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 ? " *" : ""));
//    }
    
}

package dance;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.Arrays;

public class DancingWithTheGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		FileInputStream fstream;
		try {

			  FileOutputStream fos = new FileOutputStream("dance.out");
			  System.setOut(new PrintStream(fos, true));                              
			fstream = new FileInputStream("B-large.in");

			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			int num = Integer.parseInt(br.readLine());
			int i = 0;
			while ((strLine = br.readLine()) != null) {
				i++;
				System.err.println(strLine);
				String[] splits= strLine.split(" ");
				int googlers =Integer.parseInt(splits[0]);
				int surprising =Integer.parseInt(splits[1]);
				int min_score =Integer.parseInt(splits[2]);
				int[] score_for_googler = new int[googlers];
				for (int j = 0; j < googlers; j++) {
					score_for_googler[j]=Integer.parseInt(splits[j+3]);
				}
//				System.err.println("Googlers:"+googlers);
//				System.err.println("surprising: "+surprising);
//				System.err.println("min score "+min_score);
//				System.err.println("scores"+Arrays.toString(score_for_googler));
				int result=0;
				
					
				int num_surprised=0;
				int min_unsurprised=3*min_score-2;
				int min_surprised=3*min_score-4;
				if(min_surprised<0)
					min_surprised=0;
				for (int current_score : score_for_googler) {
					
					if(current_score==0)
						continue;
					if(current_score>=min_unsurprised)
						result++;
					else if (current_score>=min_surprised) {
						if(num_surprised<surprising)
							result++;
							num_surprised++;
						
					}
//					System.err.println("Scores:"+ current_score+" "+min_unsurprised+" "+min_surprised+" "+num_surprised+" r:"+result);
				}
				if(min_score==0)
					result=googlers;
				System.out.println("Case #"+i+": "+result);
				System.err.println("Case #"+i+": "+result);
//				System.in.read();
				
				
			}
		}catch (Exception e) {
			e.printStackTrace();
		}
		
		
	}

}
