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.File;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.ArrayList;

public class B {
	
	private String nombreInputOutput;
	private BufferedReader input;
	public int surprising = 0;

	public B(String nombreInputOutput) {
		this.nombreInputOutput = nombreInputOutput;
	}

	public void run() {
		try {
			input = new BufferedReader(new FileReader(new File(nombreInputOutput + ".in")));
			PrintWriter output = new PrintWriter(new File(nombreInputOutput + ".out"));
			
			int num_cases = Integer.parseInt(input.readLine().trim());
			String Solution;
			for (int runs = 1; runs <= num_cases; runs++) {
				Solution = new Solution().solve_case(input.readLine().trim());
				String result = "Case #" + runs + ": " + Solution;
				output.println(result);
				System.out.println(result);
			}
			output.close();
		} catch (Exception e) {
				e.printStackTrace();
		}
	}

	public class Solution {
		
		public String solve_case(String caseline) throws Exception { 	
			String[] inputs = caseline.split("\\s+");
			int numGooglers = Integer.parseInt(inputs[0]);
			surprising = Integer.parseInt(inputs[1]);
			int bestResult = Integer.parseInt(inputs[2]);			
			ArrayList<Double> googlers = new ArrayList<Double>();
			int inputsTotal = inputs.length;
			for (int i = 1; i <= numGooglers; i++) {
				googlers.add(Double.parseDouble(inputs[inputsTotal - i]));
			}
			
			int maxNumGooglers = 0;
			for (Double g : googlers) {
				if (checkGoogler(g, bestResult)) {
					maxNumGooglers++;
				}
			}
			String Solution = Integer.toString(maxNumGooglers);
			return Solution;
		}
		
		private Boolean checkGoogler(Double result, int bestResult) {
			Double resultbythree = result / 3;
			if (resultbythree > bestResult-1) {
				return true;
			} else if (bestResult*3 > 5 && result > bestResult*3-5) {
				if (surprising > 0) {
					surprising--;
					return true;
				} else {
					return false;
				}
			} else {
				return false;
			}
		}
	}
	
	public static void main(String[] args) {
        B b = new B("B-large");
		b.run(); 
    }
		
}