#include <cstdio>

#include <cmath>

#include <cstring>

#include <iostream>

#include <algorithm>

#include <queue>

#include <vector>

#include <map>



using namespace std;



typedef long long LL;


int T;
double n,a,r,d;
const double pi=acos(-1.0);

int main()

{
    cin>>T;
    for (int z=1;z<=T;++z)
    {
        cin>>n>>a>>r;
        printf("Case #%d:\n",z);
        d=(a/2)/tan(pi/n);
        if (d>r) puts("Give me a kiss!");
        else puts("I want to kiss you!");
    }
    return 0;

}