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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;


public class DancingWithTheGooglers {
	public static void main(String[] args) {
		 try {
	            // t@CIuWFNgð¶¬·é
	            FileInputStream fileInputStream =
	                new FileInputStream("B-large.in");
	            InputStreamReader inputStreamReader =
	                new InputStreamReader(fileInputStream);
	            BufferedReader bufferedReader =
	                new BufferedReader(inputStreamReader);
	            // t@C©çêsÇÝæé
	            String lines = bufferedReader.readLine();
	            int len = Integer.parseInt(lines);
	            String[] str = new String[len];
	            for(int i = 0; i < len; i++){
	            	str[i] = bufferedReader.readLine();
	            }

	            // t@CIuWFNgðjü·é
	            bufferedReader.close();
	            inputStreamReader.close();
	            fileInputStream.close();


	            FileOutputStream fileOutputStream =
	                new FileOutputStream("answerDWG.txt");
	            OutputStreamWriter outputStreamWriter =
	                new OutputStreamWriter(fileOutputStream);
	            BufferedWriter bufferedWriter =
	                new BufferedWriter(outputStreamWriter);
	            //\bhú»
	            DancingWithTheGooglers dwg = new DancingWithTheGooglers();
	            for(int i = 0; i < len; i++){
	            	bufferedWriter.write("Case #" + (i+1) + ": " + dwg.keisan(str[i]) + "\n");
	            	// t@CÉàeð«Þ
	            }
	            // t@CIuWFNgðjü·é
	            bufferedWriter.close();
	            outputStreamWriter.close();
	            fileOutputStream.close();


	        // êAÌt@CÍIOExceptionª­¶·é
	        } catch (IOException ex) {
	            ex.printStackTrace();
	        }
	}
	
	private int keisan(String str){
		String[] inp = str.split(" ",-1);
		int i;
		int N = Integer.parseInt(inp[0])+3;
		int S = Integer.parseInt(inp[1]);
		int p = Integer.parseInt(inp[2]);
		int cnt = 0;
		int s_cnt = 0;
		for(i=3;i<N;i++){
			int ttl = Integer.parseInt(inp[i]);
			int a = ttl/3;
			int b = ttl%3;
			if(a >= p){
				cnt++;
			} else if(a == p-1){
				if(b > 0){
					cnt++;
				} else {
					if(a > 0 && s_cnt < S){
						cnt++;
						s_cnt++;
					}
				}
			} else if(a == p-2){
				if(b == 2 && s_cnt < S){
					cnt++;
					s_cnt++;
				}
			}
		}
		return cnt;	
	}

}
