import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;

public class CodeJam {

//	public static final String INPUT_FILE_PATH = "D://CodeJamInput.txt";
	public static final String INPUT_FILE_PATH = "D://B-large.in";
	public static final String OUTPUT_FILE_PATH = "D://CodeJamOutput.txt";

	public static List<String> readInput() {
		List<String> list = new ArrayList<String>();
		try {
			BufferedReader input = new BufferedReader(new FileReader(
					INPUT_FILE_PATH));
			try {
				String line = null;

				while ((line = input.readLine()) != null) {
					list.add(line);
				}
			} finally {
				input.close();
			}
		} catch (IOException ex) {
			ex.printStackTrace();
		}
		
		return list;
	}

	public static void writeOutput(List<String> output) {
		PrintWriter writer = null;
		try {
			writer = new PrintWriter(new FileWriter(OUTPUT_FILE_PATH));
			for (String line : output) {
				writer.println(line);
			}
			writer.flush();
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			if (writer != null)
				writer.close();
		}
	}
	
	public static void main(String[] args) {
		List<DanceFloor> danceFloors = DanceFloor.parseFromFile(CodeJam.readInput());
		List<String> output = new ArrayList<String>();

		for(int i = 0; i < danceFloors.size(); i++) {
			System.out.println(danceFloors.get(i));
			String line = "";
			line += "Case #" + (i + 1) + ": " + danceFloors.get(i).calculate();
			output.add(line);
		}
		
		CodeJam.writeOutput(output);
	}
}

class DanceFloor {

	private List<Integer> tripletsTotalCounts;
	private int surpriseCount;
	private int targetScore;
	private int dancersCount;

	public DanceFloor(List<Integer> tripletsTotalCounts, int surpriseCount,
			int targetScore, int dancersCount) {
		this.tripletsTotalCounts = tripletsTotalCounts;
		this.surpriseCount = surpriseCount;
		this.targetScore = targetScore;
		this.dancersCount = dancersCount;
	}

	public int calculate() {
		int result = 0;
		
		if (targetScore == 0) return dancersCount;
		
		for (int i = 0; i < tripletsTotalCounts.size(); i++) {
			int total = tripletsTotalCounts.get(i);

			if (total < (targetScore * 3 - 4)) {
				tripletsTotalCounts.remove(i--);
			} else if (total == 0) {
				tripletsTotalCounts.remove(i--);
			}
		}
		
		for (int i = 0; i < tripletsTotalCounts.size(); i++) {
			int total = tripletsTotalCounts.get(i);

			if ((surpriseCount > 0) && (total == targetScore * 3 - 4)) {
				result++;
				surpriseCount--;
				tripletsTotalCounts.remove(i--);
			} else if ((surpriseCount == 0) && (total == targetScore * 3 - 4)) {
				tripletsTotalCounts.remove(i--);
			}
		}
		
		for (int i = 0; i < tripletsTotalCounts.size(); i++) {
			int total = tripletsTotalCounts.get(i);

			if ((surpriseCount > 0) && (total == targetScore * 3 - 3)) {
				result++;
				surpriseCount--;
				tripletsTotalCounts.remove(i--);
			} else if ((surpriseCount == 0) && (total == targetScore * 3 - 3)) {
				tripletsTotalCounts.remove(i--);
			}
		}
		
		result += tripletsTotalCounts.size();
		
		return result;
	}

	public static List<DanceFloor> parseFromFile(List<String> readInput) {
		List<DanceFloor> result = new ArrayList<DanceFloor>();
		int testCaseCount = Integer.parseInt(readInput.get(0));

		for (int i = 0; i < testCaseCount; i++) {
			String line[] = readInput.get(i + 1).split(" ");

			List<Integer> totalCounts = new ArrayList<Integer>();
			for (int j = 0; j < Integer.parseInt(line[0]); j++) {
				totalCounts.add(Integer.parseInt(line[3 + j]));
			}

			result.add(new DanceFloor(totalCounts, Integer.parseInt(line[1]),
					Integer.parseInt(line[2]), Integer.parseInt(line[0])));
		}

		return result;
	}

	@Override
	public String toString() {
		return "dancersCount = " + dancersCount + "; surpriseCount = " + surpriseCount 
								 + "; targetScore = " + targetScore + "; tripletsTotalCounts" 
								 + tripletsTotalCounts.toString();
	}
}


import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;


public final class Googlers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
// 			*				/3	%3
// 0 	0    	000			0	0
// 1    1 		100			0	1
// 2	1	2	110 200*	0 	2	
// 3 	1   2	111 210*	1 	0
// 4    2 	2	112 022*	1 	1
// 5 	2	3	122 113*	1 	2			
// 6 	2	3	222 123*	2 	0
// 7	3	3	223 133*	2 	1
// 8	3	4	233 224*	2 	2
// 9	3	4	333 234*	3 	0
// ...
// 28	10	10  9 9 10 		9	1
// 29	10	10	9 10 10		9	2
// 30	10  10				10  0
		//  max = x/3 + x%3>=1
		// *max = x/3 + x%3=2
		
//prepare table
		int[][] max = new int[31][2];
		max[0][0] = 0;
		max[0][1] = 0;
		for (int i = 1; i <=27; i++) {
			int quotient = i / 3;
			int reminder = i % 3;
			max[i][0] = quotient + (reminder>=1?1:0);
			max[i][1] = quotient + (reminder==2?2:1);
		}
		max[28][0] = 10;
		max[28][1] = 10;
		max[29][0] = 10;
		max[29][1] = 10;
		max[30][0] = 10;
		max[30][1] = 10;
		BufferedReader br = null;
		BufferedWriter bw = null;
		try {
			br = new BufferedReader(new InputStreamReader(new FileInputStream("test.txt")));
			bw = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("solution.txt")));
			int count = 1;
			int cases = Integer.valueOf(br.readLine());
			String input;
			while (((input = br.readLine()) != null) && (count <= cases)) {
				String output = "Case #"+(count++)+": "+process(input, max);
				System.out.println(output);
				bw.write(output);
				bw.newLine();
			}
		} catch (Exception e) {// Catch exception if any
			System.err.println("Error: " + e.getMessage());
		} finally {
			if (br!=null) try { br.close(); } catch(IOException e) {}
			if (bw!=null) try {
				bw.flush();
				bw.close();
			} catch(IOException e) {}
		}
		
	}
	
	private static final int process(String input, int[][] max) {
		String[] s = input.split(" ");
		int N = Integer.valueOf(s[0]);
		int S = Integer.valueOf(s[1]);
		int p = Integer.valueOf(s[2]);
		//int t[] = new int[N];
		int count = 0;
		for (int i = 0; i < N; i++) {
			int t = Integer.valueOf(s[i+3]);
			if (max[t][0] >= p) count++;
			else if (S > 0 && max[t][1] >= p) {
				count++;
				S--;
			}
		}
		return count;
	}

}
