#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int l, d;
    cin >> l >> d;
    vector<int> grundy(l+1, -1);
    vector<vector<int>> v(l+1);
    for (int len = 1; len <= l; ++len) {
        for (int i = 1; i < len; ++i) {
            for (int j = i+1; j < len-i-j; ++j){
                if(len-i-j-i > d) continue;
                v[len].emplace_back(grundy[i]^grundy[j]^grundy[len-i-j]);
            }
        }
        sort(v[len].begin(), v[len].end());
        v[len].erase(unique(v[len].begin(), v[len].end()), v[len].end());
        for (int i = 0; i < v[len].size(); ++i) {
            if(v[len][i] != i) {
                grundy[len] = i;
                break;
            }
        }
        if(grundy[len] == -1) grundy[len] = v[len].size();
    }
    puts(grundy.back() ? "kado" : "matsu");
    return 0;
}