1011

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
    // write your code here
        Scanner sc=new Scanner(System.in);
        int N=sc.nextInt();
       long[][] num=new long[N][3];
        for (int j=0;j<N;j++){
            for (int i=0;i<3;i++){
                num[j][i]=sc.nextLong();
            }
        }

        for (int j=0;j<N;j++){
            if (num[j][0]+num[j][1]>num[j][2]){
                System.out.println("Case #"+(j+1)+": true");
            }else{
                System.out.println("Case #"+(j+1)+": false");
            }
        }

    }
}

这一题算是比较简单了，知道long范围是-2^64~2^64-1即可