Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Bear and Different Names

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIn 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.

Input

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.

Output

Find any solution satisfying all given conditions. In one line print *n* space-separated strings, denoting possible names of soldiers in the order. The first letter of each name should be uppercase, while the other letters should be lowercase. Each name should contain English letters only and has length from 1 to 10.

If there are multiple valid solutions, print any of them.

Examples

Input

8 3

NO NO YES YES YES NO

Output

Adam Bob Bob Cpqepqwer Limak Adam Bob Adam

Input

9 8

YES NO

Output

R Q Ccccccccc Ccocc Ccc So Strong Samples Ccc

Input

3 2

NO NO

Output

Na Na Na

Note

In the first sample, there are 8 soldiers. For every 3 consecutive ones we know whether they would be an effective group. Let's analyze the provided sample output:

- First three soldiers (i.e. Adam, Bob, Bob) wouldn't be an effective group because there are two Bobs. Indeed, the string
*s*_{1}is "NO". - Soldiers 2 through 4 (Bob, Bob, Cpqepqwer) wouldn't be effective either, and the string
*s*_{2}is "NO". - Soldiers 3 through 5 (Bob, Cpqepqwer, Limak) would be effective, and the string
*s*_{3}is "YES". - ...,
- Soldiers 6 through 8 (Adam, Bob, Adam) wouldn't be effective, and the string
*s*_{6}is "NO".

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/24/2019 06:50:17 (d1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|