L, D = map(int, input().split())
gr = [-1]*(L+1)
for i in range(1, L+1):
    S = set()
    for j in range(1, i):
        if j > i//2:
            continue
        for k in range(j+1, i-j):
            l = i-j-k
            if l <= k:
                break
            T = {j, k, l}
            if len(T) == 3 and max(T)-min(T) <= D:
                S.add(gr[j] ^ gr[k] ^ gr[l])
    for j in range(i+1):
        if j not in S:
            gr[i] = j
            break

print('kado' if gr[L] else 'matsu')