#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

bool isok(int a, int b, int c) {
	return a != b && a != c && b != c && (min({ a, b, c }) == b || max({ a, b, c }) == b);
}

int main() {
	int L; int D;
	while(~scanf("%d%d", &L, &D)) {
		vector<int> dp(L + 1);
		rer(n, 1, L) {
			vector<bool> vis(L + 2);
			rer(x, 1, n - 2) rer(y, x + 1, n - 1) {
				int z = n - x - y;
				if(y >= z) break;
				bool ok = true;
				ok &= z - x <= D;
				int p[3] = { x,y,z };
				bool k = false;
				do {
					k |= isok(p[0], p[1], p[2]);
				} while(next_permutation(p, p + 3));
				ok &= k;
				if(ok) {
					vis[dp[x] ^ dp[y] ^ dp[z]] = true;
				}
			}
			while(vis[dp[n]]) ++ dp[n];
		}
		bool ans = dp[L] != 0;
		puts(ans ? "kado" : "matsu");
	}
	return 0;
}