#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
 
using namespace std;
 
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(long long i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
 
#define MOD 1000000007

int l,d;

int dp[505];

int f(int n){
  if(dp[n]!=-1)return dp[n];
  set<int> se;
  rep(i,1,n){
    rep(j,i+2,n){
      int k = n-i-j;
      if(i<k&&k<j&&j-i<=d){
        se.insert(f(i)^f(j)^f(k));
      }
    }
  }
  int g = 0;
  while(se.count(g)!=0)g++;
  return dp[n] = g;
}

int main(){
  clr(dp,-1);
  cin>>l>>d;
  cout << (f(l) ? "kado":"matsu") << endl;
  return 0;
}