In the army, it isn't easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if they got an order that Bob is a scouter, if there are two Bobs?). A group of soldiers is effective if and only if their names are different. For example, a group (John, Bob, Limak) would be effective, while groups (Gary, Bob, Gary) and (Alice, Alice) wouldn't. You are a spy in the enemy's camp. You noticed n soldiers standing in a row, numbered 1 through n . The general wants to choose a group of k consecutive soldiers. For every k consecutive soldiers, the general wrote down whether they would be an effective group or not. You managed to steal the general's notes, with n - k + 1 strings s 1 , s 2 , ..., s n - k + 1 , each either " YES " or " NO ". The string s 1 describes a group of soldiers 1 through k (" YES " if the group is effective, and " NO " otherwise). The string s 2 describes a group of soldiers 2 through k + 1 . And so on, till the string s n - k + 1 that describes a group of soldiers n - k + 1 through n . Your task is to find possible names of n soldiers. Names should match the stolen notes. Each name should be a string that consists of between 1 and 10 English letters, inclusive. The first letter should be uppercase, and all other letters should be lowercase. Names don't have to be existing names — it's allowed to print " Xyzzzdj " or " T " for example. Find and print any solution. It can be proved that there always exists at least one solution. The first line of the input contains two integers n and k ( 2 ≤ k ≤ n ≤ 50 ) — the number of soldiers and the size of a group respectively. The second line contains n - k + 1 strings s 1 , s 2 , ..., s n - k + 1 . The string s i is " YES " if the group of soldiers i through i + k - 1 is effective, and " NO " otherwise. Find any solution satisfying all given conditions. In one line print n space-separated string