#include "bits/stdc++.h" #define ALL(a) (a).begin(),(a).end() #define SORT(c) sort((c).begin(),(c).end()) #define DESCSORT(c) sort(c.begin(), c.end(), greater()) using namespace std; using LL = long long int; using LD = long double; using pii = pair; using pll = pair; using pdd = pair; using vi = vector; using vvi = vector; using vvvi = vector; using vl = vector; using vvl = vector; using vvvl = vector; using vd = vector; using vvd = vector; using vs = vector; using vb = vector; using vvb = vector; const int INF = (1 << 30) - 1; const LL INF64 = ((LL)1 << 62) - 1; const double PI = 3.1415926535897932384626433832795; const int dy[] = { 0, 1, 0, -1 }; const int dx[] = { 1, 0, -1, 0 }; int gcd(int x, int y) { return y ? gcd(y, x % y) : x; } LL gcd(LL x, LL y) { return y ? gcd(y, x % y) : x; } string solve(int n, int d) { string t = ""; int copyN = n; for (; copyN; copyN--) { t.push_back('A'); d--; } if (d == 0) { return t; } for (int i = 0; i < n; i++) { if (d >= 1) { t[i] = 'B'; d -= 1; } } SORT(t); if (d == 0) { return t; } for (int i = 0; i < n; i++) { if (d < 0) { t[i] = 'C'; d++; } } SORT(t); return t; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n, d; cin >> n >> d; cout << solve(n, d) << endl; return 0; }