#include<bits/stdc++.h>
#include<iostream>
using namespace std;
int main()
{
vector<int> table;
int n, m;
while (cin >> n >> m) {
table.cleaar();
for (int i = 0; i < 2 * n; i++) table.push_back(i);
int pos = 0;
for (int i = 0; i < n; i++) {
pos = (pos + m - 1) % table.size();
table.erase(table.begin() + pos);
}
int j = 0;
for (int i = 0; i < 2 * n; i++) {
if (j < table.size() && i == table[j]) {
j++;
cout << "A";
}
else {
cout << "B";
}
cout << endl << endl;
}
}
return 0;
}