def can_badari_win(s, p):
    n = len(s)
    if n % p != 0:
        return "NO"
    k = n // p
    parts = [s[i*k:(i+1)*k] for i in range(p)]
    sorted_parts = [sorted(part) for part in parts]
    result = ''.join([''.join(part) for part in sorted_parts])
    if result < s:
        return "YES\n" + result
    else:
        return "NO"