import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    l,d=MI()
    g=[0]*(l+1)
    for l0 in range(5,l+1):
        move=[False]*505
        for l2 in range(1,l0):
            for l1 in range(1,l2):
                l3=l0-l1-l2
                if l3<=l2:break
                if l3-l1>d:continue
                move[g[l1]^g[l2]^g[l3]]=True
        for i in range(505):
            if not move[i]:
                g[l0]=i
                break
    if g[l]:print("kado")
    else:print("matsu")

main()