#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <cstdlib>  
using namespace std;

void dfs(long long N, long long K,long long idx, long long ex, vector<char> p);

static long long k=0;

int main(void) {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    long long N, K;
    cin >> N >> K;

    dfs(N, K, 0, -1, {});

    return 0;
}

void dfs(long long N, long long K,long long idx, long long ex, vector<char> p) {

    if (ex == -1 && idx >= 3) {
        if (p[idx - 3] == 'M' && p[idx - 2] == 'M' && p[idx-1] == 'A') {
            ex = idx;
        }
    }
    if (idx == N) {
        if (ex != -1) {
            k += 1;
            if (k == K) {
                for (char c : p) cout << c;
                cout << '\n';
                exit(0);
            }
        }
        return;
    }

    for (long long i = 0; i < 2; i++) {
        vector<char> pp = p;
        if (i == 0) {
            pp.push_back('A');
            dfs(N, K, idx + 1, ex, pp);
        }
        else {
            pp.push_back('M');
            dfs(N, K, idx + 1, ex, pp);
        }
    }
}