#include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<cstdlib> #include<cctype> #define MOD 1000000007 using namespace std; int countSetBits(long long int n) { unsigned int count = 0; while(n) { n &= (n-1) ; count++; } return count; } //long long int fib[1000] = {0LL%MOD,1LL%MOD,1LL%MOD,2LL%MOD,3LL%MOD,5LL%MOD,8LL%MOD,13LL%MOD,21LL%MOD,34LL%MOD,55LL%MOD,89LL%MOD,144LL%MOD,233LL%MOD,377LL%MOD,610LL%MOD,987LL%MOD,1597LL%MOD,2584LL%MOD,4181LL%MOD,6765LL%MOD,10946LL%MOD,17711LL%MOD,28657LL%MOD,46368LL%MOD,75025LL%MOD,121393LL%MOD,196418LL%MOD,317811LL%MOD,514229LL%MOD,832040LL%MOD,1346269LL%MOD,2178309LL%MOD,3524578LL%MOD,5702887LL%MOD,9227465LL%MOD,14930352LL%MOD,24157817LL%MOD,39088169LL%MOD,63245986LL%MOD,102334155LL%MOD,165580141LL%MOD,267914296LL%MOD,433494437LL%MOD,701408733LL%MOD,1134903170LL%MOD,1836311903LL%MOD,2971215073LL%MOD,4807526976LL%MOD,7778742049LL%MOD,12586269025LL%MOD,20365011074LL%MOD,32951280099LL%MOD,53316291173LL%MOD,86267571272LL%MOD,139583862445LL%MOD,225851433717LL%MOD,365435296162LL%MOD,591286729879LL%MOD,956722026041LL%MOD,1548008755920LL%MOD,2504730781961LL%MOD,4052739537881LL%MOD,6557470319842LL%MOD,10610209857723LL%MOD,17167680177565LL%MOD,27777890035288LL%MOD,44945570212853LL%MOD,72723460248141LL%MOD,117669030460994LL%MOD,190392490709135LL%MOD,308061521170129LL%MOD,498454011879264LL%MOD,806515533049393LL%MOD,1304969544928657LL%MOD,2111485077978050LL%MOD,3416454622906707LL%MOD,5527939700884757LL%MOD,8944394323791464LL%MOD,14472334024676221LL%MOD,23416728348467685LL%MOD,37889062373143906LL%MOD,61305790721611591LL%MOD,99194853094755497LL%MOD,160500643816367088LL%MOD,259695496911122585LL%MOD,420196140727489673LL%MOD,679891637638612258LL%MOD,1100087778366101931LL%MOD,1779979416004714189LL%MOD,2880067194370816120LL%MOD,4660046610375530309LL%MOD,7540113804746346429LL%MOD,12200160415121876738LL%MOD,19740274219868223167LL%MOD,31940434634990099905LL%MOD,51680708854858323072LL%MOD,83621143489848422977LL%MOD,135301852344706746049LL%MOD,218922995834555169026LL%MOD,354224848179261915075LL%MOD,573147844013817084101LL%MOD,927372692193078999176LL%MOD,1500520536206896083277LL%MOD,2427893228399975082453LL%MOD,3928413764606871165730LL%MOD,6356306993006846248183LL%MOD,10284720757613717413913LL%MOD,16641027750620563662096LL%MOD,26925748508234281076009LL%MOD,43566776258854844738105LL%MOD,70492524767089125814114LL%MOD,114059301025943970552219LL%MOD,184551825793033096366333LL%MOD,298611126818977066918552LL%MOD,483162952612010163284885LL%MOD,781774079430987230203437LL%MOD,1264937032042997393488322LL%MOD,2046711111473984623691759LL%MOD,3311648143516982017180081LL%MOD,5358359254990966640871840LL%MOD}; /*long long int fibo(long long int n) { if(n==0) return 0; else if(n==1) return 1; else if(n==2) return 2; else if(n>2) return (fibo(n-1) + fibo(n-2))%MOD; }*/ long long int fibo[1000000]; void precalc() { fibo[0] = 0LL; fibo[1] = 1LL; fibo[2] = 1LL; fibo[3] = 2LL; for(int i=4;i<1000000;i++) fibo[i] = (fibo[i-1] + fibo[i-2]) % MOD; } int main() { precalc(); int t; scanf("%d", &t); while(t--) { long long int n, g; scanf("%lld %lld", &n, &g); long long int x, y; //printf("%lld\n", fibo[n+1]); x = fibo[n+1] % MOD; //printf("%lld\n", x); int bitsetcount; y = countSetBits(x); //printf("%lld\n", y); if(y==g) printf("CORRECT\n"); else printf("INCORRECT\n"); } return 0; }