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.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.RandomAccessFile;
import java.nio.ByteBuffer;
import java.nio.channels.FileChannel;
import java.util.ArrayList;
import java.util.StringTokenizer;

/**
 * 
 */

/**
 * @author Manthravadi
 *
 */

class Googler{
	int surpriseValue,nonSurpriseValue;	
	boolean isSurprise;
	
}
public class Triplets {
	
	static int[] nonSurprise=new int[]{0,1,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10};
	static int[] surprise=new int[]{-1,-1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10,-1,-1};
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		try{
			BufferedReader br = new BufferedReader(new FileReader("B-large.in"));
			//BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			int tc=Integer.parseInt(br.readLine());
			int t = 1,len;
			FileChannel rwChannel = new RandomAccessFile("triplets.txt", "rw").getChannel();
			String string = new String();
			
			while(t<=tc){
				int count=0;
				StringTokenizer st = new StringTokenizer(br.readLine(), " ");
				
				int[] myArr = new int[st.countTokens()];
				
				//myArr[0]=n;myArr[1]=s;myAarr[2]=p;
				
				for(int i = 0;st.hasMoreTokens();i++){
					
					myArr[i]=Integer.parseInt(st.nextToken());
				}
					
				ArrayList<Googler> g = new ArrayList<Googler>();
				int p = myArr[2];
				int myArrLength = myArr.length;
				
				for(int i = 3;i<myArrLength;i++){
					
					int s = surprise[myArr[i]];
					int ns = nonSurprise[myArr[i]];
					Googler ge = new Googler();
					if(p<=s || p<=ns || (s==-1 && p<=ns)){					
						if(p<=ns && p<=s){
							ge.isSurprise=false;
							ge.surpriseValue=s;
							ge.nonSurpriseValue=ns;
						}
						else{
							ge.isSurprise=true;
							ge.surpriseValue=s;
							ge.nonSurpriseValue=ns;
						}
						if(s==-1 && p<=ns){
							ge.isSurprise=false;
							ge.nonSurpriseValue=ns;
							ge.surpriseValue=s;
							
						}
						g.add(ge);
				
						
					}				
			
					
				}
				for(Googler ge:g){
					if(ge.isSurprise==false){
						count++;
						
					}
					else{
						if(ge.surpriseValue == -1?(ge.nonSurpriseValue>=p && (myArr[1]-- >0)?true:false):(ge.surpriseValue>=p && (myArr[1]-- >0)?true:false))
							count++;
						
					}
				}
				
				g=null;
				
				if(t!=tc)
					string+="Case #"+t+": "+count+"\n";
				
				else
					string+="Case #"+t+": "+count;
				
				t++;
				count = 0;
			}
			
			len = string.length();		
			byte[] buffer = string.getBytes();
			ByteBuffer wrBuf = rwChannel.map(FileChannel.MapMode.READ_WRITE, 0, len);
			wrBuf.put(buffer);
		}
		catch(ArrayIndexOutOfBoundsException aioobe){
			System.out.println(aioobe.getMessage()+" "+aioobe.getCause());
			aioobe.printStackTrace();
		}
		catch(IOException ioe){
			System.out.println("Error : "+ioe.getMessage());
			ioe.printStackTrace();
		}
		
		catch(Exception e){
			System.out.println(e.getMessage());
			e.printStackTrace();
		}
		

	}

}
