#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
typedef long long ll;
const int INF = 1<<30;
const ll INFLL = 1LL<<60;
//const ll MOD = 998244353;
const double INFD = 1.0E10;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, -1, 0, 1};
//const int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//const int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using Pair = pair<ll, ll>;
using Graph = vector<vector<ll>>;
using mint = atcoder::modint998244353;


int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    
    ll n, k; cin >> n >> k;
    ll m = n;
    if (n >= 19) n = 18;
    
    vector<string> strs;
    for (int i = 0; i < (1<<n); i++){
        string str;
        for (int j = 0; j < n; j++){
            str.push_back('0' + ((i >> j) & 1));
        }
        bool ok = false;
        for (int j = 0; j < n - 2; j++){
            if (str.substr(j, 3) == "110") ok = true;
        }
        if (ok) strs.push_back(str);
    }
    sort(strs.begin(), strs.end());
    //cerr << strs.size() << endl;
    string ans;
    if (m > n) ans += string(m - n, 'A');
    for (auto c : strs[k - 1]){
        if (c == '0') ans.push_back('A');
        else ans.push_back('M');
    }
    cout << ans << endl;
    //AAAMMAAAAAMAMMMMAMM//正解
    //AAAAMAMMMAMMAAMMMMA
    
    return 0;
}