#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

int l,d;
int dp[525];

int dfs(int len){
  if(dp[len]!=-1)return dp[len];
  bool st[525];
  REP(i,525)st[i]=false;
  FOR(i,1,len+1)FOR(j,i+1,len+1){
    int k = len-j-i;
    if(k<=j)continue;
    if(k-i>d)continue;
    int test = dfs(i)^dfs(j)^dfs(k);
    st[test] = true;
  }
  int val = 0;
  REP(i,525){
    if(st[i])continue;
    val = i;
    break;
  }
  return dp[len]=val;
}

int main(){
  scanf("%d%d",&l,&d);
  REP(i,525)dp[i]=-1;
  int ans = dfs(l);
  if(ans){
    puts("kado");
  }else{
    puts("matsu");
  }
  return 0;
}