#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct io_setup {
	io_setup() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} io_setup;

using mint = atcoder::modint998244353;

vector<int> greedy(int n) {
	vector<int> res;
	rep(bit, 0, 1 << n) {
		int cnt = 0;
		int flg = 0;
		for (int i = n - 1; i >= 0; i--) {
			if (bit >> i & 1) cnt++;
			else {
				if (cnt >= 2) flg = 1;
				cnt = 0;
			}
		}
		if (flg) res.push_back(bit);
	}
	return res;
}

void solve() {
	int n, k;
	cin >> n >> k;
	auto build_ans = [&](ll x) {
		string ans(n, 'A');
		int i = 0;
		while (x > 0) {
			if (x & 1) ans[n - 1 - i] = 'M';
			i++;
			x /= 2;
		}
		cout << ans << '\n';
	};
	auto v = greedy(min(20, n));
	build_ans(v[k - 1]);
}

int main() {
	int t = 1;
	// cin >> t;
	while (t--) solve();
}