#include <queue>

 #include <cstdio>

 #include <vector>

 #include <algorithm>

 using namespace std;

 const int maxn = 1e5 + ;

 int t, n, m, num, u, v;

 int InDeg[maxn];

 vector<int> G[maxn];

 bool topsort() {

     num = ;

     queue<int> q;

     for(int i = ; i <= n; i++) {

         if(InDeg[i] == ) {

             q.push(i);

         }

     }

     int x;

     while(!q.empty()) {

         x = q.front(), q.pop();

         num++;

         int s = G[x].size();

         for(int i = ; i < s; i++) {

             if(--InDeg[G[x][i]] == ) {

                 q.push(G[x][i]);

             }

         }

     }

     return num == n;

 }

 int main() {

     scanf("%d", &t);

     while(t--) {

         scanf("%d%d", &n, &m);

         for(int i = ; i <= n; i++) {

             G[i].clear();

             InDeg[i] = ;

         }

         for(int i = ; i < m; i++) {

             scanf("%d%d", &u, &v);

             G[u].push_back(v);

             InDeg[v]++;

         }

         if(topsort()) {

             printf("Correct\n");

         } else {

             printf("Wrong\n");

         }

     }

     return ;

 }