/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

import java.util.*;

public class Main{
    public static void main(String[] args){
	Scanner sc = new Scanner(System.in);

	int T = sc.nextInt();
	int caseNum = 0;

	while(caseNum++<T){

	    int n = sc.nextInt();
	    int s = sc.nextInt();
	    int p = sc.nextInt();
	    int[] t = new int[n];
	    for(int i=0; i<n; i++){
		t[i] = sc.nextInt();
	    }
	    int[][] triplet = new int[n][3];
	    for(int i=0; i<n; i++){
		triplet[i][0] = t[i]/3;
		triplet[i][1] = t[i]/3;
		triplet[i][2] = t[i]/3;
		int tmp = 0;
		for(int j=t[i]%3; j>0; j--){
		    triplet[i][tmp++]++;
		}
	    }

	    int ans = 0;
	    for(int i=0; i<n; i++){
		if(triplet[i][0]>=p && triplet[i][0]!=triplet[i][1]){
		    ans++; triplet[i][0] = -1;
		}
		else if(triplet[i][0]!=triplet[i][1]){
		    triplet[i][0] = -1;
		}
		else if(triplet[i][0]>=p){
		    ans++; triplet[i][0] = -1;
		}
		else if(triplet[i][1]>0){
		    triplet[i][0]++; triplet[i][1]--;
		}
	    }

	    int count = 0;
	    for(int i=0; i<n; i++){
		if(triplet[i][0]>=p){count++;}
	    }
	    if(count>=s){ans += s;}
	    else {ans += count;}

	    System.out.println("Case #"+caseNum+": "+ans);
	}
    }
}
