God of Numbers

O Sejun, the god of natural numbers, has K natural numbers. He wants to choose exactly N numbers from them and concatenate the chosen numbers in any order to make the largest possible number.

A number may be used more than once, but each of the K input numbers must be used at least once. If the same value appears multiple times in the input, each occurrence must be used at least once.

Print the largest number that can be made while satisfying these conditions.

The first line contains K and N separated by a space. K and N are natural numbers no greater than 50, and N is at least K.

Each of the next K lines contains one natural number. Each number is no greater than 1,000,000,000. The same number may appear more than once; in that case, it must be used at least as many times as it appears in the input.

Print the largest number that can be made by choosing and concatenating N numbers under the given conditions.