hdu 2147 kiki's game（DP(SG)打表找规律）

///打表观察

/*
int f[2005][2005];

int go(int n,int m){ //0:必败　1:必胜
    if(f[n][m]!=-1) return f[n][m];
    int a1 = n-1, b1 = m;
    int a2 = n, b2 = m-1;
    int a3 = n-1,b3 = m-1;

    if(a1>=1 && b1>=1 && go(a1,b1)==1) return f[n][m] = 0;
    if(a2>=1 && b2>=1 && go(a2,b2)==1) return f[n][m] = 0;
    if(a3>=1 && b3>=1 && go(a3,b3)==1) return f[n][m] = 0;
    return f[n][m] = 1;
}
*/

int main(){
    int n,m;

    while(scanf("%d%d",&n,&m),n||m){
        /*
        rep(i,1,n)
            rep(j,1,m) f[i][j] = -1;

        f[1][1] = 0;

        go(n,m);

        rep(i,1,n){
            rep(j,1,m) printf("%d",f[i][j]); cout<<endl;
        }
        */
        if(n%2 && m%2)
            puts("What a pity!");
        else
            puts("Wonderful!");
    }
}