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.FileInputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;


public class Dance {

	static int getMaxGooglers(int N,int S, int p, int[] t) {
		int count=0;
		int surpriseCount=0;
		
		int avg=p*3;
		for(int i=0;i<N;i++) {
			
			/*if(t[i]>=avg)
				count++;
			
			else */
			if(t[i]>=p) {
				if(t[i]>=avg-2)
			
				count++;
			
			else if(surpriseCount<S)
			{
				if(t[i]>=avg-4) {
					count++;
					surpriseCount++;
				}
			}
			}
		}
		return count;
	}
	public static void main(String args[]) {
		try {
			BufferedReader br=new BufferedReader(new InputStreamReader(new FileInputStream("c:\\gcj\\B\\B-large.in")));
			String line=br.readLine();
			PrintStream ps=new PrintStream("c:\\gcj\\B\\B-large.out");
			
			int n=Integer.parseInt(line);
				for(int i=1;i<=n;i++) {
					
					line=br.readLine();				
					String[] nums=line.split(" ");
					int N=Integer.parseInt(nums[0]);
					int S=Integer.parseInt(nums[1]);
					int P=Integer.parseInt(nums[2]);
					int t[]=new int[N];
					for(int j=0;j<N;j++)
					{
						t[j]=Integer.parseInt(nums[j+3]);
					}
					ps.println("Case #"+i+": "+getMaxGooglers(N, S, P, t));
											
				}
			} 
			catch(Exception e) {
				e.printStackTrace();
			}
			
			
		}
		

	public static void ain(String[] args) {
		// TODO Auto-generated method stub
		
		int N=2;
		int S=1;
		int p=1;
		int[] t={8,0};
		System.out.println(" count : " + getMaxGooglers(N, S, p, t));
	}

}
