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.awt.List;
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;


public class Dancing {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try{
			BufferedReader bf=null;
			try {
				int T;
				bf = new BufferedReader(new FileReader("src/com/codejam/input/B-large.in"));
				T = Integer.parseInt(bf.readLine());
				
				for(int i=0;i<T;i++){
					//Map<String,ArrayList<Triplet> > googlers = new HashMap<String, ArrayList<Triplet> >();
					ArrayList<Googler> googlers = new ArrayList<Googler>();
					
					String line = bf.readLine();
					String[] numbers = line.split(" ");
					int N = Integer.parseInt(numbers[0]);
					int S = Integer.parseInt(numbers[1]);
					int P = Integer.parseInt(numbers[2]);
					
					for(int index=3;index<numbers.length;index++){
						ArrayList<Triplet> triplets= getTripletList(numbers[index],P);
						
						if(triplets!=null)
							googlers.add(new Googler(numbers[index],triplets));
							//googlers.put(numbers[index],triplets);
					}
					
					
					
					
					int count = 0; 
					int surprising = 0;
					
					for(Googler g:googlers){
						boolean isNotSurprisingfound = false;
						for(Triplet tr:g.getTriplets()){
							if(tr.isSurprising()==false){
								isNotSurprisingfound = true;
								count++;
								break;
							}
								
						}
						if(!isNotSurprisingfound){
							surprising++;
						}
					}
					
					if(surprising<S) count+=surprising;
					else count+=S;
					
					System.out.println("Case #"+(i+1)+": "+count);
					
//					for(Googler g:googlers){
//						System.out.println(g.getTotal());
//						System.out.println("------");
//						for(Triplet tr:g.getTriplets()){
//							System.out.println(tr.getS1()+" "+tr.getS2()+" "+tr.getS3()+"   "+tr.isSurprising());
//						}
//						System.out.println("------");
//					}
									
				}
				
				
			} catch (FileNotFoundException e) {
				
				e.printStackTrace();
			} finally{
				bf.close();
			}
	
			
		}catch(IOException e){
			e.printStackTrace();
		}


	}
	
	public static ArrayList<Triplet> getTripletList(String total,int best){
		ArrayList<Triplet> triplets=null;
		
		for(int s1=0;s1<11;s1++){
			for(int s2=0;s2<11;s2++){
				for(int s3=0;s3<11;s3++){
					if( (s1+s2+s3)==Integer.parseInt(total) && Math.abs(s1-s2)<=2 && Math.abs(s1-s3)<=2 && Math.abs(s2-s3)<=2 ){
						
						Triplet tr = new Triplet(s1,s2,s3);
						if(tr.getMax()>=best){
							if(triplets==null)
								triplets=new ArrayList<Triplet>();
							
							triplets.add(tr);
						}
							
					}
				}
			}
		}
		
		if(triplets !=null)
			Collections.sort(triplets);
		
		return triplets;
	}

}


