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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.Scanner;


public class Scores 
{
	public static void main(String[] args) throws IOException 
	{
		Scanner scan = new Scanner(new File("B-small-attempt0.in"));
		FileWriter strm = new FileWriter("out2.txt");
		BufferedWriter out = new BufferedWriter(strm);
		int cases = scan.nextInt();
		scan.nextLine();
		int count = 1;
		while(count - 1 < cases)
		{
			int n = scan.nextInt();
			int s = scan.nextInt();
			int p = scan.nextInt();
			int[] tots = new int[n];
			for(int i = 0;i<n;i++)
			{
				tots[i] = scan.nextInt();
			}
			out.write("Case #" + count + ": " + calc(s,p,tots) + "\n");
			count++;
		}
		out.close();
	}
	private static int calc(int s, int p, int[] tots)
	{
		Arrays.sort(tots);
		int surp = 0;
		int max = 0;
		for(int i = 0;i<tots.length;i++)
		{
			if(possible(p,tots[i]))
			{
				boolean surprise = surp(p,tots[i]);
				if(surprise)
					surp++;
				if(surp<=s || !surprise)
					max++;
			}
		}
		return max;
	}
	private static boolean possible(int max, int total)
	{
		if(max == 0)
			return true;
		if(total / max >= 3.0)
			return true;
		if(total < max)
			return false;
		total -= max;
		return Math.abs(total / 2.0 - max) <= 2.0;
	}
	private static boolean surp(int max, int total)
	{
		if(max == 0)
			return false;
		if(total / max >= 3.0)
			return false;
		total -= max;
		return Math.abs(total / 2.0 - max) >= 1.5;
	}
}
