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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define FOR(i, s, e) for (ll(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (ll(i) = (s); (i) > (e); (i)--)
#define debug(x) cout << #x << ": " << x << endl
#define mp make_pair
#define pb push_back
const ll MOD = 1000000007;
const int INF = 1e9;
const ll LINF = 1e16;
const double PI = acos(-1.0);
int dx[8] = { 0, 0, 1, -1, 1, 1, -1, -1 };
int dy[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };

/* -----  xtimex  Problem: __CONTEST_NAME__ __ALPHA__  / Link:   ----- */
/* ------問題------



-----問題ここまで----- */
/* -----解説等-----



----解説ここまで---- */

int L, D;
int memo[502];

int grundy(int a) {
	if (memo[a] != -1)return memo[a];
	set<int>s;
	FOR(i, 1, a) {
		FOR(j, i + 1, a) {
			ll k = a - (i + j);
			if (k < 1)continue;
			if (i == k || j == k)continue;
			ll M = max({ i,j,k });
			ll m = min({i,j,k});
			if (M - m <= D) {
				s.insert(grundy(i) ^ grundy(j) ^ grundy(k));
			}
		}
	}
	int ret = 0;
	while (s.count(ret))ret++;
	return memo[a] = ret;

}

int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	cin >> L>>D;
	FOR(i, 0, 502)memo[i] = -1;
	cout << ((grundy(L)!=0)?"kado":"matsu") << endl;

	return 0;
}