#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int L, D;
  cin >> L >> D;
  int is_win[L + 1];
  memset(is_win, 0, sizeof(is_win));

  for (int l = 1; l <= L; ++l) {
    set<int> S;

    for (int a = 1; a <= l - 2; ++a) {
      for (int b = 1; b <= l - a; ++b) {
        int c = l - a - b;
        if (a + b + c != l) continue;
        if (a == b) continue;
        if (a == c) continue;
        if (b == c) continue;
        if (c <= 0) continue;
        int max_l = max(a, max(b, c));
        int min_l = min(a, min(b, c));
        if (max_l - min_l > D) continue;

        S.insert(is_win[a] ^ is_win[b] ^ is_win[c]);
      }
    }

    while (S.count(is_win[l])) {
      is_win[l]++;
    }
  }

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

  return 0;
}