def f(n):
  global g
  u=[1]*n*2
  for a in range(1,n//3):
    m=n-a
    for b in range(max(a+1,m-a-D),(m+1)//2):u[g[a]^g[b]^g[m-b]]=0
  for i in range(n+1):
    if u[i]: return i
L,D=map(int,input().split())
g=[0]+[-1]*L
for n in range(1,L+1): g[n]=f(n)
print("kado" if g[L] else "matsu")