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.Scanner;


public class DanceGoogle {
	public static void main( String[] args ) throws IOException {
		File fileOut = new File( "B-large.out" );
		BufferedWriter writer = new BufferedWriter( new FileWriter(fileOut) );
		Scanner sc = new Scanner( new File ( "B-large.in" ) );
		int count = 0;
		int number = sc.nextInt();
		int caseNumber = number;
		for ( int caseNumberIndex = 0; caseNumberIndex < caseNumber; caseNumberIndex++ ) {
			int numberOfDancer = sc.nextInt();
			int numberOfSuprise = sc.nextInt();
			int bestScore = sc.nextInt();
			int compare = ( bestScore * 3 ) - 2;
			for ( int dancerIndex = 0; dancerIndex < numberOfDancer; dancerIndex++ ) {
				number = sc.nextInt();
				if ( ( number > 28 ) || ( number < 2 ) ) {
					if ( number > 28 )
						count++;
					else if( (number > 0) && (bestScore == 1) )
						count++;						
				}
				else if ( number < compare ) {
					if ( number >= (compare - 2 ) ) {
						if ( numberOfSuprise > 0 ) {
							numberOfSuprise--;
							count++;
						}
					}
				}
				else 
					count++;	
			}
			if ( bestScore == 0 ) 
				count = numberOfDancer;
			writeOutput( writer, count, caseNumberIndex );
			count = 0;
		}
		writer.close();
		sc.close();
	}
	
	private static void writeOutput( BufferedWriter writer, int count, int caseNumber ) throws IOException {		
		writer.append( "Case #" + (caseNumber+1) );		
		writer.append( ": " + count );
		writer.append( "\r\n" );
		
	}
}
