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

public class DancingWithTheGooglers {
	
	static int N,S,p;
	static int t[];
	
	static int solve() {
		int i,j,k;
		int a,b,c;
		
		int opt[][] = new int[N+1][S+1];
		boolean canMakeOne, goodScoreCaseOneBigger, goodScoreCaseOneSmaller;
		boolean canMakeTwo, goodScoreCaseTwoBigger, goodScoreCaseTwoSmaller;
		
		for (i=1;i<=N;i++) {
			
			// we need to get t[i]
			canMakeOne = false;
			goodScoreCaseOneBigger = false;
			goodScoreCaseOneSmaller = false;
			canMakeTwo = false;
			goodScoreCaseTwoBigger = false;
			goodScoreCaseTwoSmaller = false;

			for (a=0;a<=10;a++) {
				for (b=a;(b<=a+2)&&(b<=10);b++) {
					for (c=b;(c<=a+2)&&(c<=10);c++) {
						if ((a+b+c) == t[i]) {
							if ((c-a) <= 1) {
								canMakeOne = true;
								if (c >= p)
									goodScoreCaseOneBigger = true;
								else
									goodScoreCaseOneSmaller = true;
							} else {
								canMakeTwo = true;
								if (c >= p)
									goodScoreCaseTwoBigger = true;
								else
									goodScoreCaseTwoSmaller = true;
							}
						}
					}
				}
			}
			
			if (canMakeOne == true) {
				
				if (goodScoreCaseOneBigger == true) {
					for (j=0;j<=S;j++) {
						opt[i][j] = Math.max(opt[i][j], opt[i-1][j]+1);
					}
				}
				
				if (goodScoreCaseOneSmaller == true) {
					for (j=0;j<=S;j++) {
						opt[i][j] = Math.max(opt[i][j], opt[i-1][j]);
					}
				}
				
			}
			
			if (canMakeTwo == true) {
				
				if (goodScoreCaseTwoBigger == true) {
					for (j=1;j<=S;j++) {
						opt[i][j] = Math.max(opt[i][j], opt[i-1][j-1]+1);
					}
				}
				
				if (goodScoreCaseTwoSmaller == true) {
					for (j=1;j<=S;j++) {
						opt[i][j] = Math.max(opt[i][j], opt[i-1][j-1]);
					}
				}
				
			}
			
		}
		
		return opt[N][S];
	}
	
	public static void main(String[] args) throws Exception {
		int i,j,k;
		
		BufferedReader br = new BufferedReader(new FileReader("B-large.in"));
		PrintWriter out = new PrintWriter("B-large.out");
		StringTokenizer st;
		
		int T = Integer.parseInt(br.readLine());
		
		for (k=1;k<=T;k++) {
			
			st = new StringTokenizer(br.readLine());
			N = Integer.parseInt(st.nextToken());
			S = Integer.parseInt(st.nextToken());
			p = Integer.parseInt(st.nextToken());
			t = new int[N+1];
			
			for (i=1;i<=N;i++)
				t[i] = Integer.parseInt(st.nextToken());
			
			out.println("Case #"+k+": "+solve());
			
		}
		
		out.close();
		
	}

}
