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


public class Dancing 
{
	public static void main(String[] inteettskit)
	{
	    int line = 0;
	    int T = 0;
	    int N = 0; // Number of googlers
		int S = 0; // Surprises
		int p = 0; // p
		
	    Scanner line_scanner = new Scanner(System.in);
	    	
    	
	    while(line_scanner.hasNextLine())
    	{
	    	String apa = line_scanner.nextLine();
	    	Scanner int_scanner = new Scanner(apa);
	    	
//	    	System.out.println("line: " + line);
	    	
	    	if(line == 0)
	    	{
    			T = int_scanner.nextInt();
//    			System.out.println("T: " + T);
	    	}
	    	
	    	else
		    {
		    	
		    	int[] input = null;
		    	int counter = 0;
		    	
		    	while (int_scanner.hasNextInt())
		    	{
		    		if(counter == 0)
		    		{
		    			N = int_scanner.nextInt();
		    			input = new int[N+3];
		    			input[0] = N;
		    		}
		    		
		    		else
		    		{
		    			int number = int_scanner.nextInt();
		    			input[counter] = number;
//		    			System.out.println("Scanner: " + number + " counter: " + counter);
		    		}
	    			
		    		counter++;
		    	}
		    	
		    		N = input[0]; // Number of googlers
					S = input[1]; // Surprises
					p = input[2]; // p
					int t[] = new int[N]; // total scores of the googlers
					
					int possible = 0;
					
					for( int i = 0; i < N; i++)
					{
//						System.out.println(input[i+3]);
						t[i] = input[i+3];
					}
					
					
//					System.out.println("Googlers: " + N);
//					System.out.println("Surprises: " + S);
//					System.out.println("p: " + p);
//					System.out.print("Scores:");
					
					for(int score: t)
					{
//						System.out.print(" " + score); 
					}
					
//					System.out.println();
					
					for(int i = 0; i < N ; i++)
					{
						
						int retur = pp(p, t[i]);
						if(retur >= 1)
						{
							if(retur >=2)
							{
								if(S > 0)
								{
									possible++;
									S--;
								}
							}
							else
							{
								possible ++;
							}
						
						}
							
					}
					System.out.println("Case #" + (line) +": " + possible);
	    	}
	    	line++;
	    	
	    }
	}
	
	public static int pp(int p, int totalscore)
	{
		int min_normal_score = 0;
		int min_surprise_score = 0;
		
		if(p-1 >= 0)
		{
			min_normal_score = (p + (p-1) + (p-1));
		}
		
		else
		{
			min_normal_score = p;
		}
		
		if(p-2 >= 0)
		{
			min_surprise_score = (p + (p-2) + (p-2));
		}
		
		else
		{
			min_surprise_score = p;
		}
		
//		System.out.println("Minimum surprise score for p = " + p + " is " + min_surprise_score);
//		System.out.println("Minimum normal score for p = " + p + " is " + min_normal_score);
		
		if(totalscore >= min_normal_score)
		{
//			System.out.println("Always!");
			return 1;
		}
		
		else if(totalscore >= min_surprise_score)
		{
//			System.out.println("Requires surprise");
			return 2;
		}
		
		else
		{
//			System.out.println("Never!");
			return 0;
		}
	}
	
}
