#include <bits/stdc++.h>
// #include <atcoder/all>
// using mint = atcoder::static_modint<998244353>;
// using mint = atcoder::static_modint<1000000007>;
using namespace std;
// using namespace atcoder;
using ld = long double;
using ll = long long;
#define mp(a,b) make_pair(a,b)
#define rep(i,s,n) for(int i=s; i<(int)n; i++)
const vector<int> dx{1,0,-1,0},dy{0,1,0,-1};

vector<int> memo(501,-1);
int l,d;
int solve(int x){
    if(memo[x]==-1){
        vector<bool> p(501,false);
        for(int i=1; i*3<x; i++)for(int j=i+1; j<x-(i+j); j++){
            int k=x-i-j;
            if(k-i>d)continue;
            int g=solve(i)^solve(j)^solve(k);
            p[g]=true;
        }
        rep(i,0,501)if(!p[i]){
            memo[x]=i;
            break;
        }
    }
    return memo[x];
}
int main(){
    cin >> l >> d;
    if(solve(l))cout << "kado\n";
    else cout << "matsu\n";
}