#include <bits/stdc++.h>

using namespace std;

namespace {

    typedef double real;
    typedef long long ll;

    template<class T> ostream& operator<<(ostream& os, const vector<T>& vs) {
        if (vs.empty()) return os << "[]";
        auto i = vs.begin();
        os << "[" << *i;
        for (++i; i != vs.end(); ++i) os << " " << *i;
        return os << "]";
    }
    template<class T> istream& operator>>(istream& is, vector<T>& vs) {
        for (auto it = vs.begin(); it != vs.end(); it++) is >> *it;
        return is;
    }

    int L, D;
    void input() {
        cin >> L >> D;
    }

    map<pair<int, int>, int> cache;
    bool dfs(int x, int w) {
        auto key = make_pair(x, w);
        if (cache.count(key)) return cache[key];
        for (int a = 1; a <= x; a++) {
            for (int b = a; a + b <= x; b++) {
                int c = x - a - b;
                if (c < b) continue;
                if (c - a > D) continue;
                if (a == b || b == c || c == a) continue;
                if (not (dfs(a, !w) or dfs(b, !w) or dfs(c, !w))) return cache[key] = true;
            }
        }
        return cache[key] = false;
    }

    void solve() {
        cout << (dfs(L, 0) ? "kado" : "matsu")  << endl;
    }
}

int main() {
    input(); solve();
    return 0;
}