Bessie is working on an essay for her writing class. Since her handwriting leaves much to be desired, she decides to type the essay using a word processor.
The essay consists of words separated by spaces. Each word has a length between and characters inclusive and contains only lowercase or uppercase Latin letters. According to the assignment instructions, the essay must be formatted in a very specific way: each line must contain at most characters, excluding spaces. Fortunately, Bessie's word processor can enforce this requirement in the following manner:
If, when adding the next word, it fits on the current line, the word is appended to that line.
Otherwise, the word is moved to the next line, and filling continues there.
Naturally, any two consecutive words on the same line must be separated by exactly one space. No line may end with a space.
Unfortunately, Bessie's word processor has just broken. Help her format the essay according to the rules described above.
The first line contains two integers n~(1 \le n \le 100) and k~(1 \le k \le 80). The second line contains words. No word exceeds characters, which is the maximum allowed number of non-space characters in a single line.
Print Bessie's essay, formatted properly.
Example 1
Including the words "" and "", the first line contains non-space characters. Adding the word "" would increase this number to 11 > 7, so the word is moved to a new line.