困难的串

// by BNU_LZM
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

const int maxn = 110;
int a[maxn], cnt = 0, l, k;

int solve(int cur)
{
	if(cnt == k)
	{
		for(int i = 0; i < cur; i++) printf("%c", 'A' + a[i]);
		printf("\n");
		return 1;
	}
	else
	{
		for(int i = 0; i < l; i++)
		{
			a[cur] = i;
			int u = 1;
			for(int j = 1; j*2 <= cur+1; j++)
			{
				int ok = 0;
				for(int m = cur-j*2+1; m <= cur-j*2+j; m++)
				{
					if(a[m] != a[m+j]) 
					{
						ok = 1;
						break;
					}
				}
				if(!ok) 
				{
					u  = 0;
					break;
				}
			}
			if(u)
			{
				cnt++;
				if(solve(cur+1)) return 1;
			}
		}
	}
	return 0;
}

int main()
{
	freopen("in.txt", "r", stdin);
	cin >> k >> l;
	solve(0);
	return 0;
}