#include <iostream>
#include <set>
using namespace std;
int L, D;
int gr[501];

int main()
{
	cin >> L >> D;

	for (int i = 1; i <= L; i++) {
		set<int> s;
		for (int j = 1; j <= i; j++) {
			for (int k = j + 1; i-j-k>k; k++) {
				int r = i - j - k;
				if (r - j > D)continue;
				s.insert(gr[j]^gr[k]^gr[r]);
			}
		}
		while(s.count(gr[i])) gr[i]++;
	}

	if (gr[L]) {
		cout << "kado" << endl;
	}
	else {
		cout << "matsu" << endl;
	}
    
	return		0;
}