#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector #define vs vector #define vc vector #define vl vector #define vb vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvb vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> template void debug(T e) { cerr << e << endl; } template void debug(vector &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template void debug(vector> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(multiset &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(map &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } using mint = modint998244353; void debug_mint1(vector &vec) { for (int i = 0; i < vec.size(); i++) { cerr << vec[i].val() << " "; } cerr << endl; } void debug_mint2(vector> &vec) { for (int i = 0; i < vec.size(); i++) { for (int j = 0; j < vec[i].size(); j++) { cerr << vec[i][j].val() << " "; } cerr << endl; } } int main() { ll N, K; cin >> N >> K; if (N <= 18){ ll cnts = 0; for (ll i = 0; i < (1 << N); i++){ vector bin(N); for (ll j = 0; j < N; j++){ if ((i >> j) & 1){ bin[j]++; } } reverse(all(bin)); bool has = false; for (ll j = 0; j < N - 2; j++){ if (bin[j] == 1 && bin[j + 1] == 1 && bin[j + 2] == 0){ has = true; } } if (has){ cnts++; } if (cnts == K){ string ans = ""; for (ll j = 0; j < N; j++){ if (bin[j] == 0){ ans += 'A'; } else{ ans += 'M'; } } cout << ans << endl; return 0; } } } for (ll i = 0; i < N - 18; i++){ cout << 'A'; } ll cnts = 0; for (ll i = 0; i < (1 << 18); i++){ vector bin(18); for (ll j = 0; j < 18; j++){ if ((i >> j) & 1){ bin[j]++; } } reverse(all(bin)); bool has = false; for (ll j = 0; j < 16; j++){ if (bin[j] == 1 && bin[j + 1] == 1 && bin[j + 2] == 0){ has = true; } } if (has){ cnts++; } if (cnts == K){ string ans = ""; for (ll j = 0; j < 18; j++){ if (bin[j] == 0){ ans += 'A'; } else{ ans += 'M'; } } cout << ans << endl; return 0; } } }