#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cstdio>
#include <cassert>
#include <atcoder/modint>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;
using namespace atcoder;

int n, K;

int cnt = 0;
string ans;
bool dfs(string &s, bool flag) {
    if (s.length() == n) {
        if (flag) {
            cnt++;
            if (cnt == K) {
                ans = s;
                return true;
            }
        }
        return false;
    }

    s.push_back('A');
    bool res = dfs(s, flag || (s.length() >= 3 && s[s.length() - 3] == 'M' && s[s.length() - 2] == 'M'));
    s.pop_back();
    if (res) return true;
    
    s.push_back('M');
    res = dfs(s, flag);
    s.pop_back();
    return res;
}

signed main() {
    cin >> n >> K;
    string s;
    dfs(s, false);
    cout << ans << endl;
    return 0;
}