1 人解决，21 人已尝试。
1 份提交通过，共有 50 份提交。
9.9 EMB 奖励。
2796. Funny Language
单点时限: 5.0 sec
内存限制: 256 MB
There is a well know game with words. Given a word you have to write as many other words as possible using the letters from the given word. If the letter repeats multiple times in the original word, you can use it up to as many times in the new words. The order of letters in the original word does not matter. For example, given the word CONTEST you can write NOTE, NET, ON, TEST, SET, etc.
Now you are in charge of writing a new dictionary. Your task is to sneak n new words into it. You know in advance m words Wi (1 <= i <= m) that you will have to play a game with and you need to figure out which new n words to add to the dictionary to maximize the total number of words you can write out of these m words.
输入格式
The first line of the input file contains two integer numbers n (1 <= n <= 100) — the number of new words you can add to the dictionary and m (1 <= m <= 1 000) — the number of words you will play the game with. The following m lines contain original words. Each word consists of at most 100 uppercase letters from A to Z.
输出格式
Write to the output file n lines with a new word on a line.
样例
Input
3 5 A ACM ICPC CONTEST NEERC
Output
C CN E
题目标签