#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include <bits/stdc++.h>
using namespace std;
using i8  = int8_t;  using u8  = uint8_t;
using i16 = int16_t; using u16 = uint16_t;
using i32 = int32_t; using u32 = uint32_t;
using i64 = int64_t; using u64 = uint64_t;
using f32 = float_t; using f64 = double_t;
using usize = size_t;using str = string;
template <class T> using vec = vector<T>;
using wdgraph = vec<vec<pair<i32, i32>>>;
#define times(n, i) for (i32 i = 0; i < (n); i++)
#define range(n, m, i) for (i32 i = (n); i < (m); i++)
#define upto(n, m, i) for (i32 i = (n); i <= (m); i++)
#define downto(n, m, i) for (i32 i = (n); i >= (m); i--)
#define foreach(xs, x) for (auto &x : (xs))
#define all(xs) (xs).begin(), (xs).end()
#define sortall(xs) sort(all(xs))
#define reverseall(xs) reverse(all(xs))
#define uniqueall(xs) (xs).erase(unique(all(xs)), (xs).end())
#define maximum(xs) *max_element(all(xs))
#define minimum(xs) *min_element(all(xs))
const i64 MOD = 1000000007;

i32 L, D;

bool isKadomatsu(i32 a, i32 b, i32 c) {
    if (a == b || b == c || a == c)
        return false;
    if (a < 1 || b < 1 || c < 1)
        return false;
    return a < b && b > c || a > b && b < c;
}

i32 main()
{
    cin >> L >> D;
    bool kado = false;
    vec<i32> v = {0, 0, L};
    do {
        i32 n = INT_MAX;
        times(3, i) {
            if (v[i] >= 6) {
                n = min(n, v[i]);
            }
        }
        if (n == INT_MAX)
            break;
        v[0] = 1;
        v[1] = (n-1)/2 + (n-1)%2;
        v[2] = (n-1)/2;
        if (v[1] == v[2]) {
            v[1]++;
            v[2]--;
        }
        while (!(maximum(v) - minimum(v) <= D)) {
            if (v[1] - v[2] > 1) {
                if (v[2] < 6 && 1 < v[2]) {
                    v[2]--; v[0]++;
                } else {
                    v[1]--; v[0]++;
                }
            } else {
                v[2]--; v[0]++;
            }
        }
        if (isKadomatsu(v[0], v[1], v[2]) && maximum(v) - minimum(v) <= D)
            kado = !kado;
        else
            break;
    } while (maximum(v) >= 6);
    cout << (kado ? "kado" : "matsu") << endl;
    return 0;
}