#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
  }
}init;


int g[501];
int check[501];

int rec(int L, int D){
  if(check[L]) return g[L];
  check[L] = true;

  set<int> s;

  FORE(l1,1,L){
    FORE(l2,1,L){
      auto l3 = L-l1-l2;

      if(l3 >= 1 and l1 != l2 and l2 != l3 and l1 != l3 and max({l1,l2,l3}) - min({l1,l2,l3}) <= D){
        int t = rec(l1,D) ^ rec(l2,D) ^ rec(l3,D);
        s.insert(t);
      }
    }
  }

  
  int k = 0;
  while(EXIST(s,k)){
    ++k;
  }

  g[L] = k;

  return g[L];
}

bool solve(int L, int D){
  fill_array(g, 0);
  fill_array(check, false);
  
  rec(L,D);

  return g[L] != 0;
}


int main(){
  int L, D;
  while(cin >> L >> D){
    cout << (solve(L,D) ? "kado" : "matsu") << endl;
  }
  
  return 0;
}