// yukicoder 361
// Grundy Number
//
// def f(s):
//     x = set()
//     for t in （状態 s から遷移可能な状態全体）:
//         x.add(f(t))
//     return x に含まれない数字の中で最も小さい 0 以上の数

#include<iostream>
#include<cstring>
using namespace std;
const int BUF = 505;


int L, D;

void read() {
    cin >> L >> D;
}


int grundy(int s, int dp[BUF]) {
    int &ret = dp[s];
    if (ret != -1) return ret;
    
    bool isAvail[BUF] = {};

    for (int len1 = 1; len1 < s; ++len1) {
        for (int len2 = 1; len1 + len2 < s; ++len2) {
            if (len1 == len2) continue;
            
            int len3 = s - len1 - len2;
            if (len1 == len3 || len2 == len3) continue;
            if (max(len1, max(len2, len3)) - min(len1, min(len2, len3)) > D) continue;

            isAvail[grundy(len1, dp) ^ grundy(len2, dp) ^ grundy(len3, dp)] = true;
        }
    }

    for (int i = 0; i < BUF; ++i) {
        if (!isAvail[i]) {
            return ret = i;
        }
    }
}


void work() {
    int dp[BUF];
    memset(dp, -1, sizeof(dp));
    cout << (grundy(L, dp) ? "kado" : "matsu") << endl;
}


int main() {
    read();
    work();
    return 0;
}