import java.util.Scanner;
/**
 * BFS暴力搜索
 * @author RXJ
 *
 */
public class HihoCoder1121 {

	public static void main(String[] args){		
		Scanner in = new Scanner(System.in);
		int count=in.nextInt();
		while(count>0){
			int N = in.nextInt();
			int M = in.nextInt();
			int[][] value = new int[M][2];
			for(int i=0;i<M;i++){
				value[i][0]=in.nextInt();
				value[i][1]=in.nextInt();	
			}
			if(BFS(N,M,value)){
				System.out.println("Correct");
			}else{
				System.out.println("Wrong");
			}
			count--;
		}
	}

	/**
	 * 广度优先搜索
	 * @param n
	 * @param m
	 * @param value
	 */
	public static boolean BFS(int n, int m, int[][] value) {
		boolean vis[] = new boolean[n+1]; //是否已经定义过
		boolean male[] =new boolean[n+1]; //性别
		int i=0;
		while(m-->0){
			int a=value[i][0];
			int b=value[i][1];
			if(!vis[a]||!vis[b]){ //是否已经查看过
				vis[a]=true;		//设置为已经查看过
				vis[b]=true;
				male[b]=!male[a];	//设定两者性别不一致
			}
			if(male[a]==male[b]){
				return false;
			}
			i++;
		}		
		return true;
	}
}