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

static long long k = 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;
    }

    p.push_back('A');
    dfs(N, K, idx + 1, ex, p);
    p.pop_back(); 
    p.push_back('M');
    dfs(N, K, idx + 1, ex, p);
    p.pop_back(); 
}

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

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

    vector<char> p;
    dfs(N, K, 0, -1, p);

    return 0;
}