#include <bits/stdc++.h>
using namespace std;

int L, D;
int dp[1000];

int g(int L) {
	if (dp[L] != -1) return dp[L];

	set<int> st;
	for (int i = 1; i < L; i++) {
		for (int j = i + 1; i + j < L; j++) {
			int k = L - i - j;
			if (k <= j) continue;
			if (k - i <= D) {
				st.insert(g(i) ^ g(j) ^ g(k));
			}
		}
	}

	int result = 0;
	while (st.count(result)) result++;
	return dp[L] = result;
}

int main() {
	cin >> L >> D;
	memset(dp, -1, sizeof(dp));

	if (g(L) != 0) {
		cout << "kado" << endl;
	} else {
		cout << "matsu" << endl;
	}
}