l, d = map(int, input().split())

g_list = [0] * (l + 1)
for i in range(6, l + 1):
    g_set = set()
    for l1 in range(1, i // 3):
        for l2 in range(max(l1 + 1, i - 2 * l1 - d), int((i - l1) / 2 + 0.5)):
            l3 = i - l1 - l2
            g_set.add(g_list[l1] ^ g_list[l2] ^ g_list[l3])
    if 0 not in g_set:
        g_list[i] = 0
    else:
        for n in range(max(g_set) + 2):
            if n not in g_set:
                g_list[i] = n
                break
if g_list[l] == 0:
    print('matsu')
else:
    print('kado')