import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int N;
        N = s.nextInt();
        int C[] = new int[N];
        int l[] = new int[N];
        int P[][] = new int[N][2000];
        for (int j = 0; j < N; j++) {
            C[j] = s.nextInt();
            l[j] = s.nextInt();
            for (int i = 0; i < l[j]; i++) {
                P[j][i] = s.nextInt();
            }
        }
        int g = 0;
        for (int k = 0; k < N; k++) {
            for (int i = 0; i < l[k]; i++) {
                for (int j = 0; j < l[k]; j++) {
                    if (i != j) {
                        if (C[k] == P[k][i] + P[k][j]) {
                            System.out.println("Case #" + (k + 1) + ": " + (i + 1) + " " + (j + 1));
                            g = 1;
                            break;
                        }
                    }
                }
                if (g == 1) {
                    break;
                }
            }
            g = 0;
        }
        s.close();
    }
}