#include "bits/stdc++.h"
using namespace std;

#define rep(i, n) for (int i = 0; i < (n); i ++)

int g[550];
int l, d;

int grundy(int x) {
        if (g[x] != -1) return g[x];
        set<int> s;
        for (int l1 = 1; l1 < x; l1 ++) {
                for (int l2 = l1 + 1; l2 < x; l2 ++) {
                        int l3 = x - l1 - l2;
                        if (l3 <= l2 || l3 - l1 > d) continue;
                        s.insert(grundy(l1) ^ grundy(l2) ^ grundy(l3));
                }
        }
        int res = 0;
        while (s.count(res)) res ++;
        return g[x] = res;
}

int main() {
        cin >> l >> d;
        memset(g, -1, sizeof(g));
        if (grundy(l) == 0) cout << "matsu" << endl;
        else cout << "kado" << endl;
        return 0;
}