HDU1002

import java.math.BigInteger;
import java.util.Scanner;

public class HDU1002 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = 1;
        int T = 0;
        BigInteger a;
        BigInteger b;
        BigInteger sum;
        T = sc.nextInt();
        if (T >= 1 && T <= 20) {
            while (T > 0) {
                a = sc.nextBigInteger();
                b = sc.nextBigInteger();
                sum = a.add(b);
                System.out.println("Case " + n + ":");
                System.out.println(a + " + " + b + " = " + sum);
                T--;
                if (T != 0)
                    System.out.println();
                n++;
            }
        } else {
            return;
        }
    }
}