We are going to paint a sign but we can only afford stencils for $$$k$$$ letters. Update the text of the sign to use only $$$k$$$ unique letters without changing the lengths of any of the words, so that we can subtly fix the sign later.

Illustration of Sample Input 1. You can do this!
Output a phrase using at most $$$k$$$ distinct letters, substituting as few from the original text as possible. If there are multiple possible answers, output any.
2 3good luck
lool lull
3 1this is hard
ssss ss ssss
1 6impossible
imbossibee