#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>

using namespace std;
typedef long long ll;

const int INF=2000000000;

int main(){
    int n,h,t[100],ansa=0,ansb=0;
    char s[100][16],in[2];
    
    scanf("%d%d",&n,&h);
    
    for(int i=0;i<n;i++){
        scanf("%s%d",s[i],&t[i]);
    }
    
    for(int i=0;i<n;i++){
        
        for(int j=0;j<s[i][j]!='\0';j++){
            printf("? %s\n",s[i]);
            fflush(stdout);
            
            scanf("%s",in);
            ansa++;
            
            if(in[0]==s[i][j] || in[0]==s[i][j]+0x20){
                s[i][j]='_';
                ansb++;
            }else{
                t[i]--;
                j--;
            }
            
            if(t[i]<0){
                h--;
                break;
            }
        }
        
        if(h==0){
            printf("! Game Over\n");
            fflush(stdout);
            return 0;
        }
        
    }
    
    printf("! Game Clear %.1lf\n",(int)(ansb*1000.0/ansa)/10.0);
    fflush(stdout);
    
    return 0;
}