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.


-----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".

Difficulty: interview

Starter code:

Solutions:
n, k = list(map(int, input().split()))
a = input().split()
names = [chr(ord("A") + i) for i in range(26)] + [chr(ord("A") + i) + chr(ord('a') + i) for i in range(26)]
ans = [names[i] for i in range(n)]
for i in range(k - 1, n):
	if a[i - k + 1] == "NO":
		ans[i] = ans[i - k + 1]
print(*ans)


n, k = map(int, input().split())
names = []
for i in range(ord('a'), ord('z') + 1):
    names.append('A' + chr(i))
for i in range(ord('a'), ord('z') + 1):
    names.append('B' + chr(i))
pos = 0
a = input().split()
ans = []
for i in range(k - 1):
    ans.append(names[pos])
    pos += 1
for i in range(n - k + 1):
    if a[i] == "YES":
        ans.append(names[pos])
        pos += 1
    else:
        ans.append(ans[i])
print(' '.join(ans))

n, k = list(map(int, input().split()))
s = list(input().split())

def generate_name(n):
    s = ''
    for i in range(10):
        if (n == 0):
            break
        for j in range(26):
            n -= 1
            if (n == 0):
                s += chr(ord('A') + j)
                return s.title()
        s += 'Z'
    return s.title()

names = []
t = 1

for i in range(k - 1):
    names.append(generate_name(t))
    t += 1

for word in s:
    if word == 'YES':
        names.append(generate_name(t))
        t += 1
    else:
        names.append(names[-min(k - 1, len(names))])

print(' '.join(names))


n, k = map(int, input().split())
s = [i == "YES" for i in input().split()]

r = []

name = "Aa"

def nextName():
	nonlocal name
	if name[-1] == 'z': name = name + 'a'
	else: name = name[:-1] + chr(ord(name[-1]) + 1)
	return name

for i in range(k-1):
	r.append(nextName())

for i in range(n-k+1):
	r.append(nextName() if s[i] else r[i])

print(*r)

"""
ATSTNG's ejudge Python3 solution template
(actual solution is below)
"""
import sys, queue

try:
    import dev_act_ffc429465ab634  # empty file in directory
    DEV = True
except:
    DEV = False

def log(*s):
    if DEV: print('LOG', *s)

class EJudge:
    def __init__(self, problem="default", reclim=1<<30):
        self.problem = problem
        sys.setrecursionlimit(reclim)

    def use_files(self, infile='', outfile=''):
        if infile!='':
            self.infile = open(infile)
            sys.stdin = self.infile
        if infile!='':
            self.outfile = open(outfile, 'w')
            sys.stdout = self.outfile

    def use_bacs_files(self):
        self.use_files(self.problem+'.in', self.problem+'.out')

    def get_tl(self):
        while True: pass

    def get_ml(self):
        tmp = [[[5]*100000 for _ in range(1000)]]
        while True: tmp.append([[5]*100000 for _ in range(1000)])

    def get_re(self):
        s = (0,)[8]

    def get_wa(self, wstr='blablalblah'):
        for _ in range(3): print(wstr)
        return

class IntReader:
    def __init__(self):
        self.ost = queue.Queue()

    def get(self):
        return int(self.sget())

    def sget(self):
        if self.ost.empty():
            for el in input().split():
                self.ost.put(el)
        return self.ost.get()

    def release(self):
        res = []
        while not self.ost.empty():
            res.append(self.ost.get())
        return res

def tokenized(s):
    """ Parses given string into tokens with default rules """
    word = []

    for ch in s.strip():
        if ch == ' ':
            if word: yield ''.join(word); word = []
        elif 'a' <= ch <= 'z' or 'A' <= ch <= 'Z' or '0' <= ch <= '9':
            word.append(ch)
        else:
            if word: yield ''.join(word); word = []
            yield ch

    if word: yield ''.join(word); word = []

###############################################################################
ej = EJudge(  )
int_reader = IntReader()
fmap = lambda f,*l: list(map(f,*l))
parse_int = lambda: fmap(int, input().split())

# input
n, k = parse_int()

seq = fmap(lambda x: x == "YES", input().split())

names = [chr(ord('A')+i) for i in range(25)] + ['S'+chr(ord('a')+i) for i in range(25)]
names = names[:n]

for i in range(len(seq)):
    if not seq[i]:
        names[i+k-1] = names[i]

print(' '.join(names))
















def name(n):
	return chr(ord('A') + n % 26) + chr(ord('a') + n // 26)

def main():
	n, k = map(int, input().split())
	arr = list(map(str, input().split()))
	if (arr.count("YES") == 0):
		for i in range(n):
			print("Max ", end = "")
		return
	ans = ["" for i in range(n)]
	x = arr.index("YES")
	for i in range(k):
		ans[x + i] = name(i + x)
	for i in range(x + 1, n - k + 1):
		if (arr[i] == "YES"):
			ans[i + k - 1] = name(i + k - 1)
		else:
			ans[i + k - 1] = ans[i]


	for i in range(x - 1, -1, -1):
		if (arr[i] == "YES"):
			ans[i] = name(i)
		else:
			ans[i] = ans[i + k - 1]
	print(*ans)


main()

def get(x):
    return chr(ord('A') + x // 26) + chr(ord('a') + x % 26)

read = lambda: map(int, input().split())
n, k = read()
a = input().split()
ans = [0] * n
num = 1
for i in range(k - 1):
    ans[i] = num
    num += 1
for i in range(k - 1, n):
    cur = a[i - k + 1]
    if cur == 'YES':
        num += 1
        ans[i] = num
    else:
        ans[i] = ans[i - k + 1]
res = ' '.join(map(str, [get(i) for i in ans]))
print(res)

def name(n):
    if n < 26:
        return chr(n + ord('A'))
    else:
        return chr(n - 26 + ord('A')) + 'a'


n, k = tuple(map(int, input().split()))
data = list([x == 'YES' for x in input().split()])

res = []
for i in range(k-1):
    res.append(name(i))
for i in range(k - 1, n):
    if data[i - k + 1]:
        res.append(name(i))
    else:
        res.append(res[i-k+1])
print(' '.join(res))


n, k = list(map(int, input().split()))
possible_names = [a + b for a in 'QWERTYUIOPLKJHGFDSAZXCVBNM' for b in 'qwertyuioplkjhgfdsazxcvbnm']
names = [possible_names.pop() for i in range(k - 1)]
for word in input().split():
    if word == 'YES':
        names.append(possible_names.pop())
    else:
        names.append(names[-k + 1])
print(*names)


import math, sys, itertools
def main():
	n,k = map(int, input().split())
	lst = input().split()
	d = []
	it = 0
	itd = 0
	for i in range(k):
		if (it>25):
			itd+=1
			it = 0
		d.append(chr(65+itd)+chr(97+it))
		it+=1
	
	ans = []
	for i in range(k-1):
		ans.append(d.pop())
	for i in range(k-1,n):
		if lst[i-(k-1)]=="NO":
			ans.append(ans[i-(k-1)])
		else:
			ans.append(d.pop())
			d.append(ans[i-(k-1)])
	for i in range(n):
		print(ans[i], end=' ')
	print()
			
	
		
def __starting_point():
	main()

__starting_point()

n, k = map(int, input().split())
l = [True if x == 'YES' else False for x in input().split()]
 
res = list(range(k - 1))
for i in l:
    if i:
        for j in range(k):
            if j not in res[-k+1:]:
                res.append(j)
                break
    else:
        res.append(res[-k + 1])
 
names = [chr(x) + chr(y) for x in range(ord('A'), ord('Z') + 1) for y in range(ord('a'), ord('z') + 1)]
 
for i in res:
    print(names[i], end=' ')
print()

n, k = map(int, input().split())
names = []

def getNext(a):
    if a[1] == 'z':
        return chr(ord(a[0]) + 1) + 'a'
    else:
        return a[0] + chr(ord(a[1]) + 1)

a = list(input().split())
for i in range(len(a)):
    a[i] = 1 if a[i] == 'YES' else 0

tmp = 'Aa'
names.append(tmp)
if a[0]:
    for i in range(k - 1):
        tmp = getNext(tmp)
        names.append(tmp)
else:
    names.append(tmp)
    for i in range(k - 2):
        tmp = getNext(tmp)
        names.append(getNext(tmp))  
        
for i in range(k, n):
    if a[i - k + 1]:
        tmp = getNext(tmp)
        names.append(getNext(tmp))
    else:
        names.append(names[i - k + 1])
print(*names)

n, k = list(map(int, input().split()))
a = input().split()
uq_names = [chr(i) for i in range(ord('A'), ord('Z') + 1)]
uq_names += [s + 'a' for s in uq_names]
res = uq_names[:k - 1]
uni = k - 1
for i, b in enumerate(a):
    if b == "YES":
        res.append(uq_names[uni])
        uni += 1
    else:
        res.append(res[i])
print(' '.join(res))


def parent(x):
    nonlocal color
    y = x
    while color[x] != x:
        x = color[x]
    while y != x:
        color[y], y = x, color[y]    
    return x

def union(x, y):
    nonlocal color
    x = parent(x)
    y = parent(y)
    if size[x] < size[y]:
        x, y = y, x
    color[y] = x
    size[x] += size[y]

n, k = map(int, input().split())
a = input().split()
res = list(range(n))
color = list(range(n))
size = [1] * n
for i in range(n - k + 1):
    if a[i] == 'NO':
        union(i, i + k - 1)

alph = ''.join(chr(i) for i in range(ord('a'), ord('z') + 1))
names = [x+y for x in alph.upper() for y in alph] 

print(*[names[x] for x in color])

def solve(n, k, a):
    t = 0
    ans = ["" for i in range(n)] 
    
    i = 0
    while ((i < len(a)) and (a[i] == 'NO')):
        ans[i] = names[0]
        i += 1
    
    if (i == len(a)):
        for j in range(i, i + k - 1):
            ans[j] = ans[0]
        return(ans)
    
    for j in range(i, i + k):
        ans[j] = names[t]
        t += 1
    
    while (i < len(a)):
        if (a[i] == 'NO'):
            ans[i + k - 1] = ans[i]
        else:
            ans[i + k - 1] = names[t]
            t += 1
        i += 1

    return ans 




names = []
for i in range(ord('A'), ord('Z')+ 1):
    for j in range(ord('a'), ord('z')+ 1):
        names.append(chr(i) + chr(j))
'''
import random
for i in range(100000):
    n = random.randint(2, 52)
    k = random.randint(2, n)
    a = [random.choice(['YES', 'NO']) for i in range(n - k)]
    ans = solve(n, k, a)
    for i in range(0, n - k):
        s = set(ans[i:i+k])
        is_diff = len(s) == k
        if (a[i] == 'YES'):
            if (len(s) != k):
                print(n, k)
                print(a)
                print(ans)
                exit
        if (a[i] == 'NO'):
            if (len(s) == k):
                print(n, k)
                print(a)
                print(ans)
                exit
'''     
n, k = list(map(int, input().strip().split()))
is_ok = input().strip().split()
ans = solve(n, k, is_ok)
print(*ans)



#This code is dedicated to Olya S.
from random import*

n,k=list(map(int,input().split()))
s=input().split()

soliders=['' for i in range(n)]

def newname():
    name=chr(randint(65,90))
    for i in range(9):
        name+=chr(randint(97,122))
    return name
if s[0]=='NO':
        soliders[0]=newname()
        soliders[1]=soliders[0]
        for j in range(2,2+k):
            if j>n-1:
               break
            soliders[j]=newname()
else:
    for j in range(0,k):
        
        soliders[j]=newname()
    
for i in range(1,n-k+1):
    if s[i]=='YES':
        soliders[i+k-1]=newname()
    else:
        soliders[i+k-1]=soliders[i]
    
            
print(*soliders)
                





n, k = [int(i) for i in input().split()]
#n, k = 50, 2
s = [i for i in input().split()]
#s = ["YES"] * 49
res = []
c1 = ord("A")
c2 = ord("a")
c3 = ord("a")

for i in range(0, k-1):
    res1 = ""
    if (c1 == ord("Z") and c2 == ord("z")):
        res1 = chr(c1) + chr(c2) + chr(c3)
        c3 += 1
    elif (c1 == ord("Z")):
        res1 = chr(c1) + chr(c2)
        c2 += 1
    else:
        res1 = chr(c1)
        c1 += 1
    res.append(res1)


for i in range(len(s)):
    if s[i] == "NO":
        res.append(res[i])
    else:
        res1 = ""
        if (c1 == ord("Z") and c2 == ord("z")):
            res1 = chr(c1) + chr(c2) + chr(c3)
            c3 += 1
        elif (c1 == ord("Z")):
            res1 = chr(c1) + chr(c2)
            c2 += 1
        else:
            res1 = chr(c1)
            c1 += 1
        res.append(res1)

    #print(i, s[i], *res[i:])


for i in res:
    print(i, end = " ")


import sys



def main():
    names = []
    for i in range(26):        
        s = "A" + chr(ord('a')+i)
        s1 = "X" + chr(ord('a')+i)
        names.append(s)
        names.append(s1)
    
    n,k = map(int,sys.stdin.readline().split())
    r = list(sys.stdin.readline().split())
    res = ["Ho"]*n
    cur = 0

    firstYes = -1
    for i in range(n-k+1):
        if r[i] == "YES":
            firstYes = i
            break

    if firstYes == -1:
        print(" ".join(res))
        return

    for i in range(firstYes+1, firstYes+k):
        res[i] = names[cur]
        cur+=1

    for i in range(firstYes+1, n-k+1):
        if r[i] == "YES":
            res[i+k-1] = names[cur]
            cur+=1
        else:
            res[i+k-1] = res[i]

    print(" ".join(res))

main()

names = [i for i in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'] + [ 'AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsTtUuVvWwXxYyZz'[i:i+2] for i in range(0, len('AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsTtUuVvWwXxYyZz'), 2)]
n, k = map(int, input().split())
yes_no = input().split()
guess = names[:n]
for i in range(len(yes_no)):
    if yes_no[i] == 'NO':
        guess[i + k - 1] = guess[i]
print(' '.join(guess))

n, k = map(int, input().split())
words = []
for i in range(ord('A'), ord('Z') + 1):
    for j in range(ord('a'), ord('z') + 1):
        words.append(chr(i) + chr(j))

our = input().split()
 
res = [i for i in range(n)]
for j in range(50):
    for i in range(len(our)):
        if our[i] == 'NO':
            res[i] = res[i + k - 1]

for elem in res:
    print(words[elem],end=' ')

names = list("A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Ab Bb Cb Db Eb Fb Gb Hb Ib Jb Kb Lb Mb Nb Ob Pb Qb Rb Sb Tb Ub Vb Wb Xb Gh Rg Df".split())

n, k = map(int, input().split())
A = list(input().split())
find = False
ans = [0] * n
for i in range(n - k + 1):
	s = A[i]
	if find:
		if s == "YES":
			c = 0
			while (names[c] in ans[i:]):
				c += 1
			ans[i + k - 1] = names[c]
		else:
			ans[i + k - 1] = ans[i]
	else:
		if s == "NO":
			ans[i] = names[0]
		else:
			now = i
			for j in range(k):
				ans[now] = names[j]
				now += 1
			find = True
if not find:
	for i in range(n - k + 1, n):
		ans[i] = names[0]
print(" ".join(ans))

n,k = map(int,input().split())
a = list(input().split())

mem = []
mem2 = []
for i in 'abcdefghijklmnopqrstuvwxyz':
    mem.append(i)
    mem.append('a'+i)
    mem2.append('b'+i)
    mem2.append('c'+i)
dp = [-1]*(n)
c = 0
c2 = 0
for i in range(len(a)):
    if a[i] == "NO":
        if dp[i] == -1:
            dp[i] = mem2[c2]
            dp[i+k-1] = mem2[c2]
        else:    
            dp[i+k-1] = dp[i]
        c2 += 1
    else:
        for j in range(i,i+k):
            if (dp[j] == -1):
                dp[j] = mem[c]
                c += 1

for i in range(n):
    if dp[i] == -1:
        dp[i] = 'a'
            
for i in dp:
    print(i[0].upper()+i[1:],end=' ')


import random

def random_str(rango, pos):
    while True:
        x = random.randint(65,90)
        string = chr(x)
        x = random.randint(1,10)
        for i in range(x - 1):
            rand = random.randint(97,122)
            string += chr(rand)
        if string not in rango:
            break
    return string

def print_array(array):   
    result = ""
    for string in array:
        result += string + " "

    print(result)
    
n, k = map(int, input().strip().split(" "))

strings = input().strip().split(" ")
soldiers = [-1] * n

for i in range(n):
    soldiers[i] = random_str(soldiers, i)

pos = 0
for string in strings:
    
    if string == "NO":        
        aux = soldiers[pos]
        soldiers[pos + k - 1] = aux  
              
    pos += 1
        
print_array(soldiers)    

# Description of the problem can be found at http://codeforces.com/contest/771/problem/B

n, k = map(int, input().split())
l_o = input().split()

a_n = ["A"]
for i in range(1, n):
    diff = i - 25 if i >= 25 else 0 
    a_n += [chr(ord("A") + i - (26 if diff != 0 else 0)) + ("" if diff == 0 else chr(ord("a") + diff))]

for i in range(n - k + 1):
    if l_o[i] == "NO":
        a_n[i + k - 1] = a_n[i]
print(" ".join(a_n))

names = [chr(ord('A') + i) for i in range(26)]
names += ['A' + chr(ord('a') + i) for i in range(26)]

n, k = list(map(int, input().split()))
a = input().split()

for i, a_i in enumerate(a):
    if a_i == 'NO':
        names[i+k-1] = names[i]

print(' '.join(names[:n]))