#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<iostream>
using namespace std;

const double PI=acos(-1);
int main()
{
    int t,n;
    double a,r;
    scanf("%d",&t);
    for(int k=1;k<=t;k++)
    {
        int flag;
        scanf("%d%lf%lf",&n,&a,&r);
        printf("Case #%d:\n",k);
        double temp=(2*PI)/n;
        temp=(PI-temp)/2;
        double len=(a/2)*tan(temp);
        if(len>r)
            flag=1;
        else
            flag=0;
        if(flag)
            printf("Give me a kiss!\n");
        else
            printf("I want to kiss you!\n");
    }
    return 0;
}