#include"cstdio"
#include"queue"
#include"cmath"
#include"stack"
#include"iostream"
#include"algorithm"
#include"cstring"
#include"queue"
#include"map"
#include"set"
#include"vector"
#define LL long long
#define mems(a,b) memset(a,b,sizeof(a))
#define ls pos<<1
#define rs pos<<1|1
using namespace std;

const int N = 1e3+5;
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;

double pi=acos(-1);
int T,n,p=1;
double a,r,R;
int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%d%lf%lf",&n,&a,&r);
        r*=2;
        R=a*tan(pi/2-pi/n);
        printf("Case #%d:\n",p++);
        if(R>=r) printf("Give me a kiss!\n");
        else printf("I want to kiss you!\n");
    }
    return 0;
}