#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
int d, grundy[501];

int rec(int l) {
  int &g = grundy[l];
  if (g != -1) return g;
  set<int> st;
  FOR(l1, 1, l) FOR(l2, 1, l) {
    int l3 = l - (l1 + l2);
    if (l3 <= 0) continue;
    if (l1 == l2 || l2 == l3 || l3 == l1) continue;
    if (max({l1, l2, l3}) - min({l1, l2, l3}) <= d) st.emplace(rec(l1) ^ rec(l2) ^ rec(l3));
  }
  g = 0;
  while (st.count(g) == 1) ++g;
  return g;
}

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  memset(grundy, -1, sizeof(grundy));
  int l; cin >> l >> d;
  cout << (rec(l) == 0 ? "matsu\n" : "kado\n");
  return 0;
}