//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 0xcccccccccccccccLL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}



//head

bitset<499*498/2> bits;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int l, d;
	cin >> l >> d;
	if(l < 6) {
		cout << "matsu\n";
		return 0;
	}
	vi grundy(l+1);
	for(int i = 6; i <= l; i++) {
		bits = 0;
		for(int j = 1; j < i/3; j++) {
			for(int k = j+1; k < i-j-k; k++) {
				if(j+d < i-j-k) continue;
				bits.set(grundy[j]^grundy[k]^grundy[i-j-k]);
			}
		}
		int j = 0;
		while(bits.test(j)) j++;
		grundy[i] = j;
	}
	if(grundy[l]) cout << "kado\n";
	else cout << "matsu\n";
}


/*
1 0
2 0
3 0
4 0
5 0
6 1
7 1
8 1
9 2
*/