package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

import java.util.Scanner;
import java.util.ArrayList;    

public class Dancing {
    public static String[] reader() {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.nextLine());
        ArrayList<String> words = new ArrayList<String>();
        for (int i = 0; i < n; i++) {
            words.add(sc.nextLine());
        }
        String toreturn[] = new String[words.size()];
        words.toArray(toreturn);
        return toreturn;
    }
    
    public static void main(String[] args) {
        String[] input = Dancing.reader();
        for (int i = 0; i < input.length; i++) {
            String vals[] = input[i].split(" ");
            int surprise = Integer.parseInt(vals[1]);
            int min = Integer.parseInt(vals[2]);
            int counter = 0;
            int surprisecounter = 0;
            for (int j = 3; j < vals.length; j++) {
                int tocount = 0;
                int sup = 1;
                int madeit = 0;
                for (int k = min; k < 11; k++) {
                    //System.out.println(vals[j]);
                    int test = Integer.parseInt(vals[j]) - k;
                    int test2 = test/2;
                    //System.out.println("im " + k);
                    //System.out.println(test2);
                    if ((test2 - k) <= 2 && (test2 - k) >= -2 && test >= 0) {
                        if (test2 - k == 2 || k - test2 == 2) {
                            tocount = 1;
                            madeit = 1;
                            //System.out.println("surprise");
                        }
                        else {
                            tocount = 1;
                            sup = 0;
                            madeit = 1;
                            //System.out.println("no surprise");
                        }
                    }
                    //System.out.println(tocount + " " + sup);
                }
                if (tocount == 1) {
                    counter++;
                    if (sup == 1 && madeit == 1) surprisecounter++;
                }
                //System.out.println(surprisecounter);
                if (surprisecounter > surprise && sup == 1 && madeit == 1) {
                    counter--;
                    //System.out.println("WHYYY");
                    //break;
                }
            }
            System.out.println("Case #" + (i+1) + ": " + counter);
        }
    }
}
