#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <cmath>
#include <queue>
#include <set>
using namespace std;
#define ll long long
#define FOR(i,j,k) for(int i =j; i<=k ;i++)
#define ll long long
const int inf = 2000000000;
const int mod = 1000000007;

int main()
{
    
    int T;
    scanf("%d", &T);
    FOR(i,1,T)
    {
        int n;
        double r,a;
        cin>>n>>a>>r;
        printf("Case #%d:\n", i);
        double j1 = 2*3.1415926/(double)n;
        double j2 = (3.1415926- j1)/2.0;
        j1 = j1 / 2.0;
        double x = a/2.0 *sin(j2) /sin(j1);
        if(x >= r)
            printf("Give me a kiss!\n");
        else printf("I want to kiss you!\n");
    }
    return 0;
}