#include<bits/stdc++.h>
#include<string>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
int main()
{
fastio;
long long n,k,i;
string ara[100],ans[100];
cin>>n>>k;
for(i=0;i<n-k+1;i++)
cin>>ara[i];
string cur="Aa";
for(i=0;i<k-1;i++)
{
ans[i]=cur;
if(cur[1]=='z')
{
cur[0]++;
cur[1]='a';
}
else
cur[1]++;
}
for(i=0;i<n-k+1;i++)
{
if(ara[i]=="YES")
{
ans[i+k-1]=cur;
if(cur[1]=='z')
{
cur[0]++;
cur[1]='a';
}
else
cur[1]++;
}
else
ans[i+k-1]=ans[i];
}
for(i=0;i<n;i++)
cout<<ans[i]<<" ";
return 0;
}
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |