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.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Vector;

public class DancingGooglers {
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		DancingGooglers test = new DancingGooglers();
		test.botInit("B-large.in", "B-large.txt");
		//test.ropeInit("Rope-small.in", "Rope-small.txt");
	}
	
	public void botInit(String inputFile, String outputFile){
		
		BufferedReader input;
		List<Integer> result = new Vector<Integer>();
		
		try {
		
			input = new BufferedReader(new FileReader(inputFile));
			
			int cases = Integer.parseInt(input.readLine());
			
			for (int i = 0; i < cases; i++){
				
				result.add(caseSolver(input));
			}
			
			printResult(result, outputFile);
			
		} catch (FileNotFoundException fnte) {
			
			System.out.println("File " + inputFile + " not found");
			
		} catch (IOException ioe) {
			
			System.out.println("Error reading file");
		}
	}
	
	public int caseSolver(BufferedReader input) throws IOException{
		
		String line = input.readLine();
		String data[] = line.split(" ");
		int googlers = Integer.parseInt(data [0]);
		int surprises = Integer.parseInt(data[1]);
		int score = Integer.parseInt(data[2]);
		int result = 0;
		
		int surpriseScore1 = (score - 1) * 3;
		int surpriseScore2 = ((score - 1) * 3) - 1;
		//Set chick data positions
		for (int i = 3; i < data.length; i++){
			
			int currentScore = Integer.parseInt(data[i]);
			
			if (currentScore == 0 && score > 0){
				
				continue;
			}
			
			if (currentScore > surpriseScore1){
				
				result++;
				
			} else if ((currentScore == surpriseScore1 || currentScore == surpriseScore2) && surprises > 0){
				
				result++;
				surprises--;
			}
		}
		
		return result;
	}
	
	
	public void printResult(List<Integer> results, String outputFile) throws IOException{
		PrintWriter printer = new PrintWriter(new File(outputFile));
		
		for (int i = 0; i < results.size(); i++){
			
			int state = results.get(i);
			
			printer.println("Case #" + (i + 1) + ": " + state);
			printer.flush();
		}
	}
}
