#include <iostream>
#include <climits>
#include <vector>
#include <cstdio>
#include <cstring>
#include <set>
using namespace std;

int main(){
   int L,D;
   cin >> L >> D;
   vector<int> grundy(L+1,0);
   for( int i = 6; i <=L; i++ ){
      set<int> grundies;
      for( int x=1; x<=L; x++ ){
         for( int y=x+1; y<=L; y++ ){
            int z = L-x-y;
            if( z <= y ) continue;
            if( z-x >D ) continue;
            grundies.insert(grundy[x]^grundy[y]^grundy[z]);
         }
      }
      for( int g = 0 ; g < 500; g++ ){
         if( grundies.find(g)==grundies.end() ){
            grundy[i]=g;
            break;
         }
      }
      
   }
   if( grundy[L] == 0){
      cout << "matsu"<<endl;
   }
   else{
      cout <<"kado"<<endl;
   }
   return 0;        
}