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.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.*;
public class B {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("B.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B.out")));
		int C = sc.nextInt();
		for(int i=1;i<=C;i++){
			int N = sc.nextInt();
			int S = sc.nextInt();
			int B = sc.nextInt();
			boolean[] pass = new boolean[N];
			boolean[] wierd = new boolean[N];
			troll:for(int a=0;a<N;a++){
				int P = sc.nextInt();
				for(int b=0;b<=10;b++){
					for(int c=b-2;c<=b+2;c++){
						if(c>10||c<0)continue;
						for(int d=b-2;d<=b+2;d++){
							
							if(d>10||d<0)continue;
							if(b+c+d!=P)continue;
							int small = Math.min(Math.min(b,c),d);
							int big = Math.max(Math.max(b,c),d);
						//	System.out.println(b+" "+c+" "+d);
							if(big>=B){
								if(big-small==2){
									
								//	System.out.println(b+" "+c+" "+d);
									wierd[a]=true;
								}
								else if(big-small<2){
									pass[a]=true;
								//	System.out.println(b+" "+c+" "+d);
									continue troll;
								}
							}
						}
					}
				}
			}
		//	System.out.println(Arrays.toString(pass));
		//	System.out.println(Arrays.toString(wierd));
			int ans = 0;
			int used = 0;
			for(int a=0;a<N;a++){
				if(pass[a]){
					ans++;
					continue;
				}
				if(wierd[a]){
					if(used<S)ans++;
					used++;
				}
			}
			out.println("Case #"+i+": "+ans);
		}
		out.close();

	}

}
