grundy = []

def solve(L, D):
    if L < 6:
        return False
    global grundy
    grundy = [-1] * (L + 1)
    grundy[0] = 0
    for n in range(1, L + 1):
        grundy[n] = calc_grundy(n, D)
    return grundy[L] > 0

def calc_grundy(n, D):
    global grundy
    used = [False] * (n + 1) * 2
    for a in range(1, n//3):
        m = n - a
        for b in range(max(a + 1, m - a - D), (m + 1) // 2):
            used[grundy[a] ^ grundy[b] ^ grundy[m - b]] = True
    for i, tf in enumerate(used):
        if not tf:
            return i

L, D = map(int, input().split())
if solve(L, D):
    print("kado")
else:
    print("matsu")