#浮点存储以带指数方式存储,所以范围比longlong还大
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
long double a,b,c;
cin>>a>>b>>c;
long double res=a+b;
if(res>c)printf("Case #%d: true\n",i);
else printf("Case #%d: false\n",i);
}
}