#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x)<<endl
#define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout <<" "<<kbrni;cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 502;

int g[MAX_N];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int L,D;
    cin >> L >> D;
    rep(i,L+1){
        g[i] = -1;
    }
    for(int i=0;i<=L;i++){
        set<int> st;
        for(int j=1;j<i;j++){
            for(int k=j+1;k<min(i,j+D+1);k++){
                int rem = i - j - k;
                if(rem <= k){
                    break;
                }
                if(rem > j+D){
                    continue;
                }
                st.insert(g[j]^g[k]^g[rem]);
            }
        }
        int cnt = 0;
        while(1){
            if(st.find(cnt) == st.end()){
                break;
            }
            cnt++;
        }
        g[i] = cnt;
    }
    if(g[L]){
        cout << "kado\n";
    }else{
        cout << "matsu\n";
    }
    return 0;
}