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.FileReader;
import java.io.FileWriter;
import java.util.LinkedList;
import java.util.List;


public class Dancing implements Runnable {

	private BufferedReader in;
	private BufferedWriter out;
	private static String inputFile = "";
	private static String outputFile = "";
	static{
		inputFile = "B-large.in";
		outputFile = "B-large.out";
	}
	
	private String count( String inputString ) {
		if( inputString == null || inputString.length() <= 1 ) {
			return null;
		}
		
		String[] inputToken = inputString.split(" ");
		
		int scoreCount = Integer.parseInt(inputToken[0]);
		int surprise = Integer.parseInt(inputToken[1]);
		int highScore = Integer.parseInt(inputToken[2]);
		
		List<String> scores = new LinkedList<String>();
		for( int i = 3; i < inputToken.length; i++ ) {
			scores.add(i-3, inputToken[i]);
		}

		int count = find( surprise, highScore, scores );
		
		return count+"\n";
	}
	
	private int find( int surprise, int highScore, List<String> scores ) {
		for( int i = 0; i < scores.size(); i++ ) {
			int score = Integer.parseInt(scores.get(i));
			
			int remainder = score % 3;
			switch( remainder ) {
				case 0:
					if( score/3 >= highScore ) break;
					
					if( score/3 <= 0 ) {
						scores.remove(i);
						i--;
						break;
					}
					
					if( surprise <= 0 ) {
						scores.remove(i);
						i--;
					} else {
						if( score/3 < highScore-1 ) {
							scores.remove(i);
							i--;
						} else {
							surprise--;
						}
					}
					break;
				case 1:
					if( score/3 >= highScore - 1 ) break;
					scores.remove(i);
					i--;
					break;
				case 2:
					if( score/3 >= highScore - 1 ) break;
					if( score/3 >= highScore - 2 && surprise > 0 ) {
						surprise--;
						break;
					}
					
					scores.remove(i);
					i--;
					break;
			}
		}
		return scores.size();
	}
	
	private void solve() throws Exception {
		String inputString = in.readLine();
		
		int roop = Integer.parseInt(inputString);
		for( int i = 1; i <= roop; i++ ) {
			inputString = in.readLine();
			if(inputString == null || inputString.length() <= 0) {
				i--;
				continue;
			} else {
				out.write( "Case #"+i+": " + count(inputString) );
			}
		}
	}
	
	@Override
	public void run() {
		try {
			in = new BufferedReader( new FileReader(inputFile) );
			out = new BufferedWriter( new FileWriter(outputFile) );
		//	in = new BufferedReader( new InputStreamReader(System.in) );
		//	out = new BufferedWriter( new OutputStreamWriter(System.out) );
			
			solve();
			
			out.flush();
		} catch(Exception e) {
			e.printStackTrace();
		}
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new Thread(new Dancing()).start();
	}
}
