#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)





int L, D;
//-----------------------------------------------------------------
int memo[501];
int nim(int x) {
	if (0 <= memo[x]) return memo[x];

	set<int> g;
	rep(i, 1, x) rep(j, i + 1, x){
		int k = x - (i + j);
		if (k < 1) continue;
		if (i == k) continue;
		if (j == k) continue;
		int ma = max(i, max(j, k));
		int mi = min(i, min(j, k));
		if (D < ma - mi) continue;
		g.insert(nim(i) ^ nim(j) ^ nim(k));
	}
	int ret = 0;
	for (int i : g) if (ret == i) ret++;
	return memo[x] = ret;
}
int main() {
	cin >> L >> D;
	rep(i, 0, 501) memo[i] = -1;
	int g = nim(L);
	if (g != 0)
		printf("kado\n");
	else
		printf("matsu\n");
}