#include #define pb push_back #define mp make_pair #define mtt make_ttuple #define ll long long #define pii pair #define ttii ttuple #define N 200005 #define mod 1000000005 #define X firstt #define Y second #define eps 0.0000000001 #define all(x) x.begin(),x.end() #define ttott(x) x+1,x+n+1 using namespace std; string in = "Incorrect!\n", co = "Correct!\n", tt; char s[N]; int ok, t, i, n, j; int main() { cin.sync_with_stdio(0); cout.sync_with_stdio(0); cin >> t; cin.getline(s, 100); for(; t; t--) { cin.getline(s, 100); i = 0; if(s[0] == 'B' && s[1] == ' ') { ok = 1; tt.resize(0); i = 2; while(s[i] && s[i] != ' ') tt += s[i++]; if(tt.size() == 2 || tt.size() == 3) { for(j = 0; j < tt.size(); j++) if(!isdigit(tt[j]) && ok) { cout << in; ok = 0; } tt.resize(0); i++; while(s[i] && s[i] != ' ') tt += s[i++]; if(tt.size() == 3) { for(j = 0; j < tt.size(); j++) if((!(tt[j] >= 'A' && tt[j] <= 'Z')) && ok) { cout << in; ok = 0; } } else if(ok) { cout << in; ok = 0; } if(ok) { if(s[i] == 0) cout << co; else { cout << in; ok = 0; } } } else { if(ok) { cout << in; ok = 0; } } } else { ok = 1; if(s[2] == ' ') { for(j = 0; j < 2; j++) if(!(s[j] >= 'A' && s[j] <= 'Z') && ok) { cout << in; ok = 0; } tt.resize(0); i = 3; while(s[i] && s[i] != ' ') tt += s[i++]; if(tt.size() == 2) { for(j = 0; j < tt.size(); j++) if(!isdigit(tt[j]) && ok) { cout << in; ok = 0; } tt.resize(0); i++; while(s[i] && s[i] != ' ') tt += s[i++]; if(tt.size() == 3) { for(j = 0; j < tt.size(); j++) if(!(tt[j] >= 'A' && tt[j] <= 'Z') && ok) { cout << in; ok = 0; } } else if(ok) { cout << in; ok = 0; } if(ok) { if(s[i] == 0) cout << co; else { cout << in; ok = 0; } } } else { if(ok) { cout << in; ok = 0; } } } else { if(ok) { cout << in; ok = 0; } } } } return 0; }