16612번 - Aligned Typesetting 다국어

문제

For this problem, a sentence with n words is a sequence of n non-empty strings [w₁, w₂, . . . , w_n]. Given a sentence, a valid typesetting of length L is a string of length exactly L which is formed by concatenating all the words in the sentence and inserting a positive number of spaces between each adjacent pair of words.

An aligned typesetting is a valid typesetting such that the number of spaces in between each adjacent pair of words is equal.

For example, given the sentence [harry, ron, hermione] and using _ to indicate a space:

• the string __harry_ronhermione is not a valid typesetting;
• the string harry_ron_____hermione is a valid typesetting of length 22 but it is not an aligned typesetting;
• the string harry___ron___hermione is an aligned typesetting of length 22.

Darcy was given a sentence of n words and the desired length of typesetting L. Can you help him to figure out whether it is possible to construct an aligned typesetting of the desired length?

입력

The first line contains two integers n (1 ≤ n ≤ 10⁶), which is the number of words, and L (0 ≤ L ≤ 10⁶), which is the desired length of typesetting.

The next n lines describe the words. Each of these lines contains a single string w_i, representing the i^th word in the sentence. The word contains only lowercase letters and consists of at least 1 and at most 10⁶ characters.

The total length of all the words in the sentence is guaranteed to be at most 10⁶.

출력

Display if there is an aligned typesetting of the sentence with the given length.

제한

힌트