#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using namespace std;

const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};

int memo[510];

int l,d;

int rec(int cur){
	int &ret=memo[cur];
	if(ret!=-1) return ret;
	set<int> s;

	rep(cmin,1,cur+1)rep(cmax,cmin+2,min(cmin+d,cur)+1){
		const int mid=cur-cmax-cmin;
		if(cmin < mid && mid < cmax){
			//cerr << cmin << " " << mid << " " << cmax << endl;
			int add=rec(cmin)^rec(mid)^rec(cmax);
			s.insert(add);
		}
	}

	ret=0;
	while(s.find(ret)!=end(s)) ret++;
	return ret;
}

int main(void){
	clr(memo,-1);
	cin >> l >> d;

	assert(1<=d);
	assert(d<=l);
	assert(l<=500);

	int res=rec(l);
	if(res)
		puts("kado");
	else
		puts("matsu");
	return 0;
}