package com.example;

import java.io.IOException;
import java.util.List;

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;

//Importing Java.io package classes to perform file management operations

//DANCE OF GOOGLERS

public class DanceOfGooglers
{	
	DanceOfGooglers()
	{
		Combinations combinations[] = new Combinations[31];
		for(int i = 0 ; i < 31 ; i++)
		{
			combinations[i] = new Combinations();
		}
	}

	static void doSort(int G[] , int N)
	{
		for(int i = 0 ; i < (N-1) ; i++)
		{
			int min = i;

			for(int j = (i + 1) ; j < N ; j++)
			{
				if(G[j] < G[min])
				{
					min = j;
				}
			}

			if(min != i)
			{
				int temp = G[min];
				G[min] = G[i];
				G[i] = temp;
			}
		}
	}

	public static void main(String[] args)
	{
		int limit = 30;
		int maxInt = 10;

		//Since there are total 31 Numbers 0-30 (Inclusive)
		Combinations combinations [] = new Combinations[31];

		for(int l = 0 ; l < 31 ; l++)
		{
			combinations[l] = new Combinations();
		}

		for(int sum = 0 ; sum <= limit ; sum++)
		{
			for(int i = 0 ; i <= maxInt ; i++)
			{
				for(int j = 0 ; j <= maxInt ; j++)
				{
					for(int k = 0 ; k <= maxInt ; k++)
					{
						if((i + j + k) > sum)
						{
							break;
						}

						if((i + j + k) == sum)
						{
							combinations[sum].populateSets(i, j, k);
							break;
						}
					}
				}
			}			
		}

		try
		{
			// Open the input file
			FileInputStream fistream = new FileInputStream("B-large.in");
			
			// Get the object of DataInputStream
			DataInputStream in = new DataInputStream(fistream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			
			//Create output file
			File file = new File("output.out");
			boolean exist = file.createNewFile();
			
			if (!exist)
			{
				System.out.println("File already exists.");
				System.exit(0);
			}
			
			FileWriter fostream = new FileWriter("output.out");
			BufferedWriter out = new BufferedWriter(fostream);
			
			int counter = 0;		//Counter purpose
			
			//Read File Line By Line
			int totalNumberOfCases = 0;
			while ((strLine = br.readLine()) != null)
			{
				if(counter == 0)
				{
					//Ignore the first Line for Conversion
					totalNumberOfCases = Integer.parseInt(strLine);
					counter++;
					continue;
				}
				
				String[] results = strLine.split(" ");
				
				int N = Integer.parseInt(results[0]);
				int S = Integer.parseInt(results[1]);
				int P = Integer.parseInt(results[2]);
				int G[] = new int[N];
				
				//int suprisesRemaining = 0;
				int maxBestResult = 0;
				
				for (int i = 0 ; i < N ; i++)
				{
					G[i] = Integer.parseInt(results[i+3]);
				}
				
				doSort(G , N);
				
				//System.out.println(combinations[G[0]].bestResult[0] + " " + combinations[G[0]].bestResult[1]);
				
				for(int i = 0 ; i < N ; i++)
				{
					if(combinations[G[i]].bestResult[1] < P)	//Non Surprising 
					{
						if(combinations[G[i]].bestResult[0] < P || combinations[G[i]].bestResult[0] == 1000)	//Surprising
						{
							//Ignore
							continue;
						}
						else
						{
							if(S != 0)
							{
								maxBestResult++;
								S--;
							}
						}
					}
					else
					{
						maxBestResult++;			
					}
				}
				
				// Print the content in the output file
				out.write("Case #" + counter + ": " + maxBestResult);
				
				
				//System.out.println(N + " " + S + " " + P + " " + G[0] + " " + G[1] + " " + G[2]);
				/*
				System.out.println("Displaying Combinations");
				System.out.println("=======================");
				
				for(int i = 0 ; i < 31 ; i++)
				{
					combinations[i].displayCombinations(i);
				}
				*/
				
				if(counter < totalNumberOfCases)
				{
					out.write("\n");
				}
				counter++;
			}

			//Close the input stream
			in.close();

			//Close the output Stream
			out.close();

		}
		catch(Exception e)
		{
			//Catch exception if any
			System.err.println("Error: " + e.getMessage() + " : " + e);
		}
	}
}