import sys

def main():
    L, D = map(int, sys.stdin.readline().split())
    
    grundy = [0] * (L + 1)
    
    for n in range(1, L + 1):
        reachable = set()
        max_a = (n - 3) // 3
        for a in range(1, max_a + 1):
            remaining = n - a
            max_b = (remaining - 1) // 2  # c needs to be >b, so remaining -b >b → 2b < remaining → b < remaining/2
            min_b = a + 1
            for b in range(min_b, max_b + 1):
                c = n - a - b
                if c <= b:
                    continue  # ensures c >b
                if c - a > D:
                    continue
                # Compute grundy value for this split
                g_val = grundy[a] ^ grundy[b] ^ grundy[c]
                reachable.add(g_val)
        mex = 0
        while mex in reachable:
            mex += 1
        grundy[n] = mex
    
    if grundy[L] != 0:
        print("kado")
    else:
        print("matsu")

if __name__ == "__main__":
    main()