ACM-ICPC ShangHai 2014

#include <cstdio>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>

using namespace std;

const int N = 105;


typedef struct node{ 
    
    int xi,v;
    
    bool operator < (const node &a)const{ 
           if (xi == a.xi) return v < a.v;
         else return  xi > a.xi;
    }

}node;

node newnode(int x,int y){ 
    node tmp;
    tmp.xi = x;
    tmp.v = y;
    return tmp;
}

int n,m,k;

int a[N],b[N],tmpa[N],tmpb[N]; 

priority_queue<node>Q[N];


int main(){

    int T; cin >> T;

    while (T--){ 
         
         cin >> n >> k;

         for (int i = 1;i <= n;i++) scanf("%d",&a[i]);
         
         for (int i = 1;i <= n;i++) b[i] = i;
   
        for (int i = 1;i <= n;i++) Q[a[i]%k].push(newnode(a[i],1));

        for (int i = 1;i <= n;i++) Q[b[i]%k].push(newnode(b[i],-1));
       
        int flag = 0; int cnt = 0;

        for (int t = 0;t < k;t++,cnt = 0){
          while(!(Q[t].empty())){ 
                  node u = Q[t].top();
                  Q[t].pop();
                  cnt += u.v;
                  if (cnt < 0) flag = 1;
        }
        
        if (cnt != 0) flag = 1; 
        
        }
        
        if (flag) printf("Tom\n");
            else printf("Jerry\n");

    }
    
}