#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<vector>
#include<queue>
using namespace std;
#define mem(a,t) memset(a,t,sizeof(a))
#define LL long long
#define MP make_pair
#define REP(i,n) for(i=0;i<(n);i++)
#define REPP(i,a,b) for(i=(a);i<(b);i++)
const int inf=0x1f1f1f1f;
const double PI=3.1415926;
const int mod=1000000007;
#define N 1000005
double a,r;
double fun(int n)
{
    double t,v;
    v=(n-2)*180/(n*2);
    //printf("v=%.2f %.2f\n",v,tan(v/180*PI));
    t=tan(v/180*PI)*a/2.0;

    return t;
}
int main()
{
    int T,i,n,cnt=1;
    //printf("%.2f\n",tan(45*1.0/180*PI));
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%lf%lf",&n,&a,&r);
        double t=fun(n);
       // printf("%.2f\n",t);
        printf("Case #%d:\n",cnt++);
        if(t>=r)
            printf("Give me a kiss!\n");
        else
            printf("I want to kiss you!\n");
    }
    return 0;
}