#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);

    int N, K;
    cin >> N >> K;

    vector dp(N, vector(2, vector(2, vector(2, vector<int>(2)))));
    rep(a, 2)rep(b, 2)rep(c, 2) dp[N - 3][a][b][c][a == 1 && b == 1 && c == 0] = 1;

    for(int i = N - 4; i >= 0; i--){
        rep(a, 2)rep(b, 2)rep(c, 2)rep(d, 2)rep(f, 2){
            int nf = f; 
            nf |= (a == 1 && b == 1 && c == 0);
            dp[i][a][b][c][nf] = min(K, dp[i][a][b][c][nf] + dp[i + 1][b][c][d][f]);
        }
    }

    K--;
    bool checked = false;
    vector<tuple<int, int, int>> ans;

    vector<char> S;
    rep(i, N - 2){
        if(i == 0){
            bool is_break = false;
            rep(a, 2)rep(b, 2)rep(c, 2){
                if(is_break) break;

                int v = dp[i][a][b][c][1];
                if(checked) v += dp[i][a][b][c][0];

                if(v <= K){
                    K -= v;
                }
                else{
                    ans.push_back({a, b, c});
                    is_break = true;
                    checked |= a == 1 && b == 1 && c == 0;

                    S.push_back(a);
                    S.push_back(b);
                    S.push_back(c);
                }
            }
        }
        else{
            auto [_, a, b] = ans.back();

            rep(c, 2){
                int v = dp[i][a][b][c][1];
                if(checked) v += dp[i][a][b][c][0];

                if(v <= K){
                    K -= v;
                }
                else{
                    ans.push_back({a, b, c});
                    checked |= a == 1 && b == 1 && c == 0;
                    S.push_back(c);
                    break;
                }
            }
        }
    }
    
    rep(i, N) cout << (S[i] ? "M" : "A") << (i == N - 1 ? "\n" : "");
}