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.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.io.IOException;


public class Googlers {

	public static void main(String args[]) throws IOException
	{
		int totalValid;
		int surp, numGooglers, maxNum, calcSurp;
		try
		{ 
			PrintWriter wt= new PrintWriter("C:\\Documents and Settings\\windows\\workspace\\test\\src\\file.out.txt");
			Scanner I = new Scanner(new File("C:\\Documents and Settings\\windows\\workspace\\test\\src\\B-large.in"));
			String num = I.nextLine();
			int numTests = Integer.parseInt(num);

			for(int x=0; x<numTests; x++)
			{

				int i = 0;
				String[] str = I.nextLine().split(" ");
				int inputs[] = new int[150];
				for(int y = 0; y <str.length; y++ )
				{  
					inputs[y] = Integer.parseInt(str[y]);
				}

				numGooglers = inputs[0];
				surp = inputs[1];
				maxNum = inputs[2];
				totalValid = 0;
				calcSurp = 0;
				for( i = 3; i < numGooglers + 3 ; i++)
				{
					if (isGoogler(inputs[i], maxNum) == 1)
					{
						totalValid++; 
					}
					else if(isGoogler(inputs[i], maxNum) == 2)
					{
						calcSurp++;
					}	
					else
					{}
				}
				
				// match surp numbers
				 if (calcSurp > surp)
				 {	totalValid = totalValid + surp; 
				 }
				 else 
				 {
					totalValid = totalValid + calcSurp;
				 }
				//logic to write totalValid to file
				String finalResult = "Case #"+(x+1)+": "+totalValid;
				
				wt.println(finalResult);
				finalResult = "";
			}
			wt.close();
			I.close();
		}
		catch(FileNotFoundException e)
		{
			e.printStackTrace();
		}

		catch(IOException e)
		{
			System.out.println(e);
		}
	}


	// Replacement algorithm
	public static int isGoogler (int num,int max)
	{  
		if (max == 0 && max <= num)
			return 1;
	    else if (num <= 0)
	    	return 0;
    	else if (num >= ((max * 3)-2 ))
		 return 1;
		else if (num >= ((max * 3)-4 ))
		 return 2;
		else return 0;
		}
}		 




