#include #include #include using namespace std; typedef long long ll; #define rep(i,n) for(int i=0;i<(n);i++) int dp[510][510]; int grundy(int L, int D){ if(dp[L][D] != -1)return dp[L][D]; set s; for (int i = 1; i <= L; ++i){ for (int j = i; j <= L; ++j){ for (int k = i; k <= L; ++k){ if(i + j + k == L && k - i <= D){ s.insert(grundy(i, D) ^ grundy(j, D) ^ grundy(k, D)); } } } } int res = 0; while(s.count(res)) res++; return dp[L][D] = res; } int main(void){ rep(i, 510)rep(j, 510) dp[i][j] = -1; int l, d; cin >> l >> d; if(grundy(l, d) == 0){ printf("kabo\n"); }else{ printf("matsu\n"); } return 0; }