#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

bool dp[501];

int main(void) {
    int l, d;
    cin >> l >> d;

    int i, j, k;
    REP (i,1,l) {
        bool win = false;
        REP (j,1,i/3) REP (k,j+1,i/2) if (i - (j+k) > k && i - (j+k) - j <= d) {
            win |= dp[j] != dp[k] != dp[i-(j+k)];
        }
        dp[i] = win;
    }
    if (dp[l])
        cout << "kado" << endl;
    else
        cout << "matsu" << endl;
    return 0;
}