#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    string s(n, 'A');
    int cnt = 0;
    auto dfs = [&](auto f, int pos, int flag) -> void
    {
        if (pos >= n && flag)
        {
            ++cnt;
            if (cnt >= k)
            {
                cout << s << endl;
                exit(0);
            }
        }
        else if (pos < n)
        {
            s[pos] = 'A';
            f(f, pos + 1, (flag | (pos >= 2 && s[pos - 2] == 'M' && s[pos - 1] == 'M' && s[pos] == 'A')));
            s[pos] = 'M';
            f(f, pos + 1, flag);
        }
    };
    dfs(dfs, 0, 0);
}