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.*;
import java.util.*;

public class GCJ_Q_B
{
//	public static String 
//	public static int 
//	ArrayList list = new ArrayList();
//	HashMap map = new HashMap();
//	HashSet set = new HashSet();
	
//	for(int i=0;i<;i++)
	
//	for(int j=0;j<;j++)
	
//	for(int k=0;k<;k++)
	
//	System.out.println();
//	System.out.print();
//	System.out.printf("", new Object{});
//	System.out.printf("", new Integer{});
//	System.out.printf("", new Long{});
	
	public static void main(String[] args) throws Exception
	{
	//	Scanner scanner = new Scanner(new FileInputStream("B.txt"));
	//		Scanner scanner = new Scanner(new FileInputStream("B-small-attempt0.in"));
		Scanner scanner = new Scanner(new FileInputStream("B-large.in"));
		
		BufferedWriter writer = new BufferedWriter(new FileWriter("B.out"));
		
		int N = scanner.nextInt();
		//	scanner.nextLine();
		for(int q=1;q<=N;q++)
		{
			int n = scanner.nextInt();
			int s = scanner.nextInt();
			int p = scanner.nextInt();
			int[] t = new int[n];
			for(int i=0;i<n;i++)
				t[i] = scanner.nextInt();
			String ans = answer(s, p, t);
			System.out.println("Case #"+q+": "+ans);
			writer.write("Case #"+q+": "+ans);
			writer.newLine();
		}
		
		writer.close();
		scanner.close();
	}
	
	public static String answer(int s, int p, int[] t) throws Exception
	{
		int c = 0;
		if(p==1)
		{
			for(int i=0;i<t.length;i++)
				if(t[i] >= 1)
					c++;
		}
		else
		{
			int min = p*3-4;
			int ok = p*3-2;
			for(int i=0;i<t.length;i++)
				if(t[i] >= min)
				{
					if(t[i] >= ok)
						c++;
					else if(s>0)
					{
						s--;
						c++;
					}
				}
		}
		
		return c+"";
	}
	
	
	
	// ç´ å æ°åè§£
	static boolean[] primeList = null;
	
	public static int[] dividePrime(int num)
	{
		if(primeList==null)
			primeList = primeListOfEratosthenes(10000);
		
		if(primeList[num] || num==1)
			return new int[]{num};
		
		ArrayList list1 = new ArrayList();
		for(int i=2;true;i++)
		{
			if(num==1)
				break;
			
			if(num%i==0)
			{
				list1.add(new Integer(i));
				num /= i;
				i--;
			}
		}
		
		int[] ret = new int[list1.size()];
		for(int i=0;i<ret.length;i++)
			ret[i] = ((Integer)list1.get(i)).intValue();
		
		return ret;
	}
	
	// æ´æ°åè§£   1 2 12 3 ...
	public static int[] splitInteger(String s)
	{
		StringTokenizer st = new StringTokenizer(s, " ");
		int[] ret = new int[st.countTokens()];
		for(int i=0;i<ret.length;i++)
			ret[i] = Integer.parseInt(st.nextToken());
		
		return ret;
	}
	
	// ç´ æ°ãªã¹ã
	public static boolean[] primeListOfEratosthenes(int max)
	{
		boolean[] list = new boolean[max+1];
		
		for(int i=2;i<list.length;i++)
		{
			if(!list[i])
			{
				for(int j=i*2;j<=max;j+=i)
					list[j] = true;
			}
		}
		
		for(int i=0;i<list.length;i++)
			list[i] = !list[i];	
		
		list[0] = list[1] = false;
		
		return list;
	}
}
