import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

import java.util.Scanner;

public class cj1 {
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int T = s.nextInt();
		for (int i = 1; i<=T; i++) {
			int N = s.nextInt();
			int S = s.nextInt();
			int p = s.nextInt();
			int nc=0;
			int nawt=0;
			int nbwt=0;
			int naw=0;
			int nbw=0;
			int delta=0;
			for (int j = 1; j<=N; j++) {
				int ti = s.nextInt();
				if (ti==0) {
					if(ti==p) {
						nbw++;
						nbwt++;
					}
					continue;
				}
				if((ti-1)%3==0) {
					if ((ti+2)/3>=p) nc++;
				}
				if(ti%3==0){
					if(ti/3>=p) {
						nbw++;
						nbwt++;
					}
					else if((ti+3)/3>=p) nbw++;
				}
				if((ti+1)%3==0) {
					if ((ti+1)/3>=p) {
						naw++;
						nawt++;
					}
					else if ((ti+4)/3>=p) naw++;
				}
			}
			if(S<=(naw+nbw-nawt-nbwt)) delta=S;
			else delta=naw+nbw-nawt-nbwt;
			int max = nc + nawt + nbwt + delta;
			System.out.println("Case #" + i + ": "+ max);
		}
	}
}
