#include<bits/stdc++.h>
using namespace std;
int t,n,m;
string s[1001],str[5];
void check(){
    string s[20];
    bool flag=0,vis=0;;
    for(int i=1;i<=2*m;i++){
        cin>>s[i];
    }
    for(int i=1;i<=2*m;i++){
        int len=s[i].size();
        if(s[i][0]=='/'&&s[i][1]=='/'&&s[i][2]=='f'&&s[i][3]=='r'&&s[i][4]=='e'&&s[i][5]=='o'&&s[i][6]=='p'&&s[i][7]=='e'&&s[i][8]=='n'&&s[i][9]=='('&&s[i][10]==34&&s[i][len-2]==')'&&s[i][len-1]==';'){
            cout<<"Wrong file operation takes you to your ancestors along with your 3 years' efforts on OI.\n";
            vis=1;
            break;
        }
        if(i%2){
            if(len<=25){
                flag=1;
                continue;
            }
        }else{
            if(len<=27){
                flag=1;
                continue;
            }
        }
        if(s[i][0]!='f'){
            flag=1;
            continue;
        }
        if(s[i][1]!='r'){
            flag=1;
            continue;
        }
        if(s[i][2]!='e'){
            flag=1;
            continue;
        }
        if(s[i][3]!='o'){
            flag=1;
            continue;
        }
        if(s[i][4]!='p'){
            flag=1;
            continue;
        }
        if(s[i][5]!='e'){
            flag=1;
            continue;
        }
        if(s[i][6]!='n'){
            flag=1;
            continue;
        }
        if(s[i][7]!='('){
            flag=1;
            continue;
        }
        if(s[i][8]!=34){
            flag=1;
            continue;
        }
        int lenn=str[(i+1)/2].size();
        for(int j=0;j<lenn;j++){
            if(s[i][j+9]!=str[(i+1)/2][j]){
                flag=1;
                continue;
            }
        }
        if(s[i][lenn+9]!='.'){
            flag=1;
            continue;
        }
        if(i%2){
            if(s[i][lenn+10]!='i'){
                flag=1;
                continue;
            }
            if(s[i][lenn+11]!='n'){
                flag=1;
                continue;
            }
            if(s[i][lenn+12]!=34){
                flag=1;
                continue;
            }
            if(s[i][lenn+13]!=','){
                flag=1;
                continue;
            }
            if(s[i][lenn+14]!=34){
                flag=1;
                continue;
            }
            if(s[i][lenn+15]!='r'){
                flag=1;
                continue;
            }
            if(s[i][lenn+16]!=34){
                flag=1;
                continue;
            }
            if(s[i][lenn+17]!=','){
                flag=1;
                continue;
            } 
            if(s[i][lenn+18]!='s'){
                flag=1;
                continue;
            }
            if(s[i][lenn+19]!='t'){
                flag=1;
                continue;
            }
            if(s[i][lenn+20]!='d'){
                flag=1;
                continue;
            }
            if(s[i][lenn+21]!='i'){
                flag=1;
                continue;
            }
            if(s[i][lenn+22]!='n'){
                flag=1;
                continue;
            }
            if(s[i][lenn+23]!=')'){
                flag=1;
                continue;
            } 
            if(s[i][lenn+24]!=';'){
                flag=1;
                continue;
            }
        }else{
            if(s[i][lenn+10]!='o'){
                flag=1;
                continue;
            }
            if(s[i][lenn+11]!='u'){
                flag=1;
                continue;
            }
            if(s[i][lenn+12]!='t'){
                flag=1;
                continue;
            }
            if(s[i][lenn+13]!=34){
                flag=1;
                continue;
            }
            if(s[i][lenn+14]!=','){
                flag=1;
                continue;
            }
            if(s[i][lenn+15]!=34){
                flag=1;
                continue;
            }
            if(s[i][lenn+16]!='w'){
                flag=1;
                continue;
            }
            if(s[i][lenn+17]!=34){
                flag=1;
                continue;
            }
            if(s[i][lenn+18]!=','){
                flag=1;
                continue;
            } 
            if(s[i][lenn+19]!='s'){
                flag=1;
                continue;
            }
            if(s[i][lenn+20]!='t'){
                flag=1;
                continue;
            }
            if(s[i][lenn+21]!='d'){
                flag=1;
                continue;
            }
            if(s[i][lenn+22]!='o'){
                flag=1;
                continue;
            }
            if(s[i][lenn+23]!='u'){
                flag=1;
                continue;
            }
            if(s[i][lenn+24]!='t'){
                flag=1;
                continue;
            }
            if(s[i][lenn+25]!=')'){
                flag=1;
                continue;
            } 
            if(s[i][lenn+26]!=';'){
                flag=1;
                continue;
            }
        }
    }
    if(flag){
    	if(!vis){
    		cout<<"Good luck and have fun.\n";
		}
	}else{
		if(!vis){
			cout<<"PION2202 RP++.\n";
		}
	}
    return;
}
int main(){
    cin>>t>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>str[i];
    }
    while(n--){
        check();
    }
    return 0;
}