#include using namespace std; typedef long long ll; typedef vector vi; typedef vector vl; typedef complex P; typedef pair pii; #define REP(i,n) for(ll i=0;ii+d)continue; bool test = dfs(i)^dfs(j)^dfs(k); if(!test){ return dp[len]=true; } } return dp[len]=false; } int main(){ scanf("%d%d",&l,&d); REP(i,525)dp[i]=-1; REP(i,6)dp[i]=false; bool ans = dfs(l); if(ans){ puts("kado"); }else{ puts("matsu"); } return 0; }