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 codejam;
import java.util.ArrayList;
import java.util.Collections;
public class DWG {
	int findCount(int N,int S,int p,ArrayList<Integer>arr){
		int count = 0;
		Collections.sort(arr);
		int i = 0;
		while( S != 0 && i<arr.size()){
			int val = 0;
			
			val = arr.get(i);			
			if( (val -3)%3 == 0 && (val-3)>=0){
				int q = (val -3 ) / 3;
				if( (q+2) >=p){
					count++;
					arr.set(i, -1);
					S--;
				}
			}
			else if( (val -2)%3 == 0 &&(val-2)>=0){
				int q = (val -2 ) / 3;
				if( (q+2) >=p){
					count++;
					arr.set(i, -1);
					S--;
				}
			}
			else if( (val -4)%3 == 0 && (val -4)>=0){
				int q = (val -4 ) / 3;
				if( (q+2) >=p){
					count++;
					arr.set(i, -1);
					S--;
				}
			}
			i++;
		}
		for(i = 0; i<N;i++){
			int val = arr.get(i);
			if( val >=0){
				if( (val)%3 == 0){
					int q = (val ) / 3;
					if( (q) >=p){
						count++;
						arr.set(i, -1);						
					}
				}
				else if( (val - 2)%3 == 0 && (val - 2)>=0){
					int q = (val -2 ) / 3;
					if( (q+1) >=p){
						count++;
						arr.set(i, -1);
						
					}
				}
				else if( (val-1)%3 == 0 && (val - 1)>=0){
					int q = (val -1 ) / 3;
					if( (q+1) >=p){
						count++;
						arr.set(i, -1);
						
					}
				}
				
			}
		}	
		
		return count;
	}
	public static void main(String []args){
		DWG d = new DWG();
		
		FileRead fr = new FileRead("B-small-attempt1.in");
		FileWrite fw = new FileWrite("B-small-ouput1.txt");
		
		int num = 0;
		
		int t = fr.readNextInt();
		for(int i = 0; i< t ; i++){
			int arr[] = fr.readNextIntArray();
			
			ArrayList<Integer> a = new ArrayList<Integer>();
			int j = 0;
			for(;j<arr[0];j++){
				a.add(arr[j+3]);
			}
			
			num = d.findCount(arr[0], arr[1], arr[2], a);
			fw.writeLine("Case #"+(i+1)+": "+num);
			
		}
		fw.close();
		fr.close();

	}
}
