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.IOException;
import java.io.StringReader;
import java.util.HashSet;
import java.util.Set;


public class Dancing {

	
	public static void main(String [] args) throws NumberFormatException, IOException
	{
		BufferedReader in = new BufferedReader(new StringReader(args[0]));
		int rows = Integer.parseInt(in.readLine());
		for ( int i = 1; i <= rows; i++)
		{
			String line = in.readLine();
			String[] vals = line.split(" ");
			int googlers = Integer.parseInt(vals[0]);
			int surprising = Integer.parseInt(vals[1]);
			int score = Integer.parseInt(vals[2]);
			int [] googlerScores = new int[googlers];
			
			for ( int j = 0; j < googlerScores.length; j++)
			{
				googlerScores[j]=Integer.parseInt(vals[3+j]);
			}
			
			//System.out.println("Surprising: " + surprising);
			int maxCount = 0;
			
			int normalCount = 0;
			int suprisingCount = 0;
			Set<Integer> normals = new HashSet<Integer>();
			for ( int k = 0; k < googlers; k++ )
			{
				if ( getBestRegularScore(googlerScores[k])>=score )
				{
					normalCount++;
					normals.add(k);
				}				
			}
			
			for ( int k = 0; k < googlers; k++ )
			{
				if ( !normals.contains(k) 
						&& getBestSurprisingScore(googlerScores[k])>=score )
				{
					suprisingCount++;
				}				
				if ( suprisingCount == surprising )
				{
					break;
				}
			}
			
//			for ( int j = 0; j < Math.pow(2, googlers); j++)
//			{
//				if ( instanceCount(j) == surprising )
//				{
//					//System.out.println("Case: " + Integer.toBinaryString(j));
//					int count = 0;
//					for ( int k = 0; k < googlers; k++ )
//					{
//						int pow = (int) Math.pow(2,k);
//						boolean normal = (pow & j) == 0;
//						//System.out.println(k+": "+ normal);
//						if ( normal && getBestRegularScore(googlerScores[k])>=score )
//						{
//							count++;
//						}
//						else if ( !normal && getBestSurprisingScore(googlerScores[k])>=score )
//						{
//							count++;
//						}
//					}
//					if ( count >= maxCount )
//					{
//						maxCount = count;
//					}
//					
//				}
//			}
			
			System.out.println("Case #"+i+": " + (normalCount+suprisingCount));
		}
	}
	
	public static int instanceCount(int number)
	{
		int count = 0;
		for ( char c : Integer.toString(number, 2).toCharArray() )
		{
			if ( c == '1' )
			{
				count++;
			}
		}
		return count;
	}
	
	public static int getBestRegularScore(int totalScore)
	{
		int bestScore = totalScore/3;
		if ( totalScore%3>0)
		{
			bestScore++;
		}
		return bestScore>10?10:bestScore;
	}
	
	public static int getBestSurprisingScore(int totalScore)
	{
		if ( totalScore == 0 )
		{
			return 0;
		}
		int ret = (totalScore+4)/3; 
		return ret>10?10:ret;
	}
}
