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.util.ArrayList;
import java.util.Scanner;


public class DancingGooglers {

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(new File("input.in"));
		BufferedWriter bfrw = new BufferedWriter(new FileWriter("output.out"));
		
		int N = in.nextInt();
		String output = "";
		for(int i = 0; i < N;i++){
			
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			
			int [] num = new int[n];
			for(int j = 0; j < n;j++){
				num[j] = in.nextInt();
			}
			output += "Case #"+(i+1)+": " + solve(num,s,p) + "\n";
		}
		
		bfrw.write(output);
		in.close();
		bfrw.close();
	}
	
	private static int solve(int [] num, int S, int P){
		int ans = 0;
		
		for(int x = 0; x < num.length;x++) {
			int N = num[x];
			ArrayList<String> al = new ArrayList<String>();
			for(int i = 10; i >= 0; i--){
				for(int j = 10; j >= 0; j--){
					for(int k = 10; k >= 0; k--){
						if(i+j+k == N && Math.max(Math.max(i,j), k) >= P && isValid(i, j, k)){
							
							//System.out.println(i + " " + j +" " + k);
							al.add(i+","+j+","+k);
							//break here;
						}
					}
				}
			}
			
			if(al.size() > 0 && !isSurprizeTrue(al)){
				ans++;
			} else if (al.size() > 0 && isSurprizeTrue(al) && S > 0) {
				ans++;
				S--;
			}
			//System.out.println();
		}
		return ans;
	}
	
	private static boolean isSurprizeTrue(ArrayList<String> al){
		for(int i = 0; i < al.size();i++){
			String[] s = al.get(i).split(",");
			if(!isSurprize(Integer.parseInt(s[0]),Integer.parseInt(s[1]),Integer.parseInt(s[2]))) return false;
		}
		return true;
	}
	
	private static boolean isValid(int i,int j, int k){
		if(Math.abs(i-j) > 2) return false;
		if(Math.abs(i-k) > 2) return false;
		if(Math.abs(j-k) > 2) return false;
		return true;
	}
	
	private static boolean isSurprize(int i,int j, int k){
		if(Math.abs(i-j) == 2) return true;
		if(Math.abs(i-k) == 2) return true;
		if(Math.abs(j-k) == 2) return true;
		return false;
	}
}
