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


public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		HashMap<Integer,Integer> nonsurprising=new HashMap<Integer, Integer>();
		HashMap<Integer,Integer> surprising=new HashMap<Integer, Integer>();

		for(int i=0;i<=10;i++)
			for(int j=0;j<=10;j++)
				for(int k=0;k<=10;k++)
				{
					if(Math.abs(i-j)>2||(Math.abs(i-k)>2)||(Math.abs(k-j)>2))
					{
						continue;
					}
					else if(Math.abs(i-j)<=2||(Math.abs(i-k)<=2)||(Math.abs(k-j)<=2))
					{
						//suprising
						Integer sum=i+j+k;
						Integer local_Max=Math.max(i, Math.max(j, k));
						if(surprising.containsKey(sum))
						{
							Integer Global_max=surprising.get(sum);
							if(local_Max>Global_max)
							{
								surprising.remove(sum);
								surprising.put(sum, local_Max);
							}
						}
						else
						{
							surprising.put(sum, local_Max);
						}
						if(Math.abs(i-j)<=1&&(Math.abs(i-k)<=1)&&(Math.abs(k-j)<=1))
						{
							//nonsurprising
						
							if(nonsurprising.containsKey(sum))
							{
								Integer Global_max=nonsurprising.get(sum);
								if(local_Max>Global_max)
								{
									nonsurprising.remove(sum);
									nonsurprising.put(sum, local_Max);
								}
							}
							else
							{
								nonsurprising.put(sum, local_Max);
							}
						}
					}
					else
					{
						
					}
				}

		Scanner input=new Scanner(System.in);
		int t=input.nextInt();
		for(int l=1;l<=t;l++)
		{
			int n=input.nextInt();
			int s=input.nextInt();
			int p=input.nextInt();
			
			int[] totalsum=new int[n+1];
			for(int j=1;j<=n;j++)
			{
				totalsum[j]=input.nextInt();
			}
			
			int [][] M=new int [n+1][s+1];
			for(int j=0;j<=s;j++)
				M[0][j]=0;
			for(int i=1;i<=n;i++)
			{
				if(nonsurprising.get(totalsum[i])>=p)
					M[i][0]=M[i-1][0]+1;
				else
					M[i][0]=M[i-1][0];
			}
			for(int i=1;i<=n;i++)
				for(int j=1;j<=s;j++)
				{
					
					int vertical=M[i-1][j]+(nonsurprising.get(totalsum[i])>=p?1:0);
					int diag=M[i-1][j-1]+(surprising.get(totalsum[i])>=p?1:0);
					if(vertical>diag)
						M[i][j]=vertical;
					else
						M[i][j]=diag;
				}
			System.out.println("Case #"+l+": "+M[n][s]);
		}
	}

}
