def solve1(n, k):
    dp = [[[0] * 4 for _ in range(2)] for _ in range(n + 1)]
    dp[2][0] = [1] * 4
    for i in range(2, n):
        dpi = dp[i]
        ndpi = dp[i + 1]
        for e in range(2):
            for h in range(4):
                for t in range(2):
                    h3 = (t * 4) | h
                    nh = h3 >> 1
                    ne = e | (h3 == 6)
                    ndpi[ne][nh] += dpi[e][h]
        dp[i + 1] = [[min(e, 2**20) for e in vs] for vs in ndpi]

    s = []
    for i in range(4):
        if dp[n][1][i] < k:
            k -= dp[n][1][i]
            continue
        # k <= dp[n][i]
        s.append(i >> 1)
        s.append(i & 1)
        break
    done = False
    for l in range(1, n - 1)[::-1]:
        if done:
            c0 = 2 ** min(l - 1, 20)
            if k <= c0:
                s.append(0)
            else:
                k -= c0
                s.append(1)
            continue
        # try 0
        may = s[-2] == s[-1] == 1
        if may:
            c0 = 2 ** min(l - 1, 20)
        else:
            c0 = dp[l + 1][1][s[-1] * 2 + 0]
        if k <= c0:
            if may:
                done = True
            s.append(0)
        else:
            k -= c0
            s.append(1)

    ans = "".join("AM"[si] for si in s)
    return ans

if __name__ == "__main__":
    n, k = map(lambda s_: int(s_), input().split())
    print(solve1(n, k))