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.File;
import java.io.FileReader;
import java.io.FileWriter;


public class Dance {
	
public static int[][] JudgedScores(int a){
	
	int div=a/3;
	int[][] Demo=new int[1][3];
	
	
	if(a==0) { Demo[0][0]=0; Demo[0][1]=0; Demo[0][2]=0;
	
	}
	else {Demo[0][0]=div; Demo[0][1]=div; Demo[0][2]=div;
	
	if(Demo[0][0]+Demo[0][1]+Demo[0][2]==a){} else {Demo[0][0]=Demo[0][0]+1;}
	if(Demo[0][0]+Demo[0][1]+Demo[0][2]==a){} else {Demo[0][1]=Demo[0][1]+1;}
	}
	
	
	return Demo;
}

public static int[][] SurpriseCheck(int a,int b,int[][] c){
	
	int surprisesAllowed=a;
	int bestNo=b;
	int [][] googlerScores=c;
	
	if(surprisesAllowed==0 || bestNo==0 || bestNo==1) return googlerScores;
	else{
		int surprisesDone=0;
		
		for(int i=0;i<googlerScores.length;i++){
			int[][] Demo=new int[1][3];
			Demo[0][0]=googlerScores[i][0];
			Demo[0][1]=googlerScores[i][1];
			Demo[0][2]=googlerScores[i][2];
			
			int flag=0;
			
			if(Demo[0][0]>=bestNo) {flag=1;}
			else if(Demo[0][1]>=bestNo) {flag=1;}
			else if(Demo[0][2]>=bestNo) {flag=1;}
			
			else if(flag==0){
				
				Demo[0][0]=Demo[0][0]+1; Demo[0][1]=Demo[0][1]-1;
				if(Demo[0][0]-Demo[0][1]>2 || Demo[0][0]-Demo[0][1]<-2 || Demo[0][0]-Demo[0][2]>2 || Demo[0][0]-Demo[0][2]<-2){
					
					Demo[0][0]=Demo[0][0]-1; Demo[0][1]=Demo[0][1]+1;
				}
				else{
					
					if(Demo[0][0]==bestNo)
					{flag=1;}
					
					else {Demo[0][0]=Demo[0][0]-1;  Demo[0][1]=Demo[0][1]+1;  }
					
				}
				
	if(flag==0){
					
		Demo[0][0]=Demo[0][0]+1; Demo[0][1]=Demo[0][2]-1;
		if(Demo[0][0]-Demo[0][1]>2 || Demo[0][0]-Demo[0][1]<-2 || Demo[0][0]-Demo[0][2]>2 || Demo[0][0]-Demo[0][2]<-2){
			
			Demo[0][0]=Demo[0][0]-1;  Demo[0][2]=Demo[0][2]+1;
		}
		else{
			
			if(Demo[0][0]==bestNo)
			flag=1;
			
			else {Demo[0][0]=Demo[0][0]-1; Demo[0][2]=Demo[0][2]+1;}
			
		}
					}
				
				
				if(flag==0){
					
					Demo[0][0]=Demo[0][0]+2; Demo[0][1]=Demo[0][1]-1; Demo[0][2]=Demo[0][2]-1;
					if(Demo[0][0]-Demo[0][1]>2 || Demo[0][0]-Demo[0][1]<-2 || Demo[0][0]-Demo[0][2]>2 || Demo[0][0]-Demo[0][2]<-2){
						
						Demo[0][0]=Demo[0][0]-2;Demo[0][1]=Demo[0][1]+1; Demo[0][2]=Demo[0][2]+1;
					}
					else{
						
						if(Demo[0][0]==bestNo)
						flag=1;
					
						else{ Demo[0][0]=Demo[0][0]-2; Demo[0][1]=Demo[0][1]+1; Demo[0][2]=Demo[0][2]+1;}
						
					}
					}
			
				
if(flag==0){
					
					Demo[0][1]=Demo[0][1]+1; Demo[0][0]=Demo[0][0]-1;
					if(Demo[0][1]-Demo[0][0]>2 || Demo[0][1]-Demo[0][0]<-2 || Demo[0][1]-Demo[0][2]>2 || Demo[0][1]-Demo[0][2]<-2){
						
						Demo[0][1]=Demo[0][1]-1;Demo[0][0]=Demo[0][0]+1;
					}
					else{
						
						if(Demo[0][1]==bestNo)
						flag=1;
						
						else {Demo[0][1]=Demo[0][1]-1;Demo[0][0]=Demo[0][0]+1;}
						
					}
					}

if(flag==0){
	
	Demo[0][1]=Demo[0][1]+1; Demo[0][2]=Demo[0][2]-1;
	if(Demo[0][1]-Demo[0][0]>2 || Demo[0][1]-Demo[0][0]<-2 || Demo[0][1]-Demo[0][2]>2 || Demo[0][1]-Demo[0][2]<-2){
		
		Demo[0][1]=Demo[0][1]-1;Demo[0][2]=Demo[0][2]+1;
	}
	else{
		
		if(Demo[0][1]==bestNo)
		flag=1;
		
		else {Demo[0][1]=Demo[0][1]-1;Demo[0][2]=Demo[0][2]+1;}
		
	}
	}

if(flag==0){
	
	Demo[0][1]=Demo[0][1]+2; Demo[0][0]=Demo[0][0]-1;Demo[0][2]=Demo[0][2]-1;
	if(Demo[0][1]-Demo[0][0]>2 || Demo[0][1]-Demo[0][0]<-2 || Demo[0][1]-Demo[0][2]>2 || Demo[0][1]-Demo[0][2]<-2){
		
		Demo[0][1]=Demo[0][1]-2; Demo[0][0]=Demo[0][0]+1;Demo[0][2]=Demo[0][2]+1;
	}
	else{
		
		if(Demo[0][1]==bestNo)
		flag=1;
		
		else {Demo[0][1]=Demo[0][1]-2;Demo[0][0]=Demo[0][0]+1;Demo[0][2]=Demo[0][2]+1;}
		
	}
	}
if(flag==0){
	
	Demo[0][2]=Demo[0][2]+1; Demo[0][0]=Demo[0][0]-1;
	if(Demo[0][2]-Demo[0][0]>2 || Demo[0][2]-Demo[0][0]<-2 || Demo[0][1]-Demo[0][2]>2 || Demo[0][1]-Demo[0][2]<-2){
		
		Demo[0][2]=Demo[0][2]-1;Demo[0][0]=Demo[0][0]+1;
	}
	else{
		
		if(Demo[0][2]==bestNo)
		flag=1;
		
		else {Demo[0][2]=Demo[0][2]-1;Demo[0][0]=Demo[0][0]+1;}
		
		}
	}

if(flag==0){
	
	Demo[0][2]=Demo[0][2]+1; Demo[0][1]=Demo[0][1]-1;
	if(Demo[0][2]-Demo[0][0]>2 || Demo[0][2]-Demo[0][0]<-2 || Demo[0][1]-Demo[0][2]>2 || Demo[0][1]-Demo[0][2]<-2){
		
		Demo[0][2]=Demo[0][2]-1;Demo[0][1]=Demo[0][1]+1;
	}
	else{
		
		if(Demo[0][2]==bestNo)
		flag=1;
		
		else {Demo[0][2]=Demo[0][2]-1;Demo[0][1]=Demo[0][1]+1;}
		
		}
	}

if(flag==0){
	
	Demo[0][2]=Demo[0][2]+1;Demo[0][0]=Demo[0][0]-1;Demo[0][1]=Demo[0][1]-1;
	if(Demo[0][2]-Demo[0][0]>2 || Demo[0][2]-Demo[0][0]<-2 || Demo[0][1]-Demo[0][2]>2 || Demo[0][1]-Demo[0][2]<-2){
		
		Demo[0][2]=Demo[0][2]-1;Demo[0][0]=Demo[0][0]+1;Demo[0][1]=Demo[0][1]+1;
	}
	else{
		
		if(Demo[0][2]==bestNo)
		flag=1;
		
		else {Demo[0][2]=Demo[0][2]-1;Demo[0][0]=Demo[0][0]+1;Demo[0][1]=Demo[0][1]+1;}
		
	}
	}


if(flag==1) surprisesDone=surprisesDone+1;
				
			}	
			
			googlerScores[i][0]=Demo[0][0];
			googlerScores[i][1]=Demo[0][1];
			googlerScores[i][2]=Demo[0][2];
			
			if(surprisesDone==surprisesAllowed){return googlerScores;}
			}
		
	
		
	}
	
	return googlerScores;
}
	

public static int checkResult(){
	
	return 0;

}
	public static void main(String args[]) throws Exception{
		BufferedReader reader = new BufferedReader(new FileReader(new File("C:/Users/Faisal/Downloads/B-large.in")));
		BufferedWriter writer = new BufferedWriter(new FileWriter(new File("B-large.in")));
		String line = reader.readLine();
		int k = Integer.parseInt(line);
		int count=1;
		for(int i = 0 ; i < k ; i ++){
			line = reader.readLine();
		
		String[] newLine=line.split(" ");
			
			
			
			
			System.out.println(count);
			count++;
			int noOfGooglers=Integer.parseInt(newLine[0]); System.out.println("noOfGooglers "+noOfGooglers);
			int surprises=Integer.parseInt(newLine[1]);
			int bestNo=Integer.parseInt(newLine[2]);
			int[] totalScores=new int[noOfGooglers]; 
			
			for(int j=3,n=0;j<newLine.length;j++,n++){
				totalScores[n]=Integer.parseInt(newLine[j]);
				System.out.println("totalScores "+totalScores[n]);
				
		    }
			
			int [][] googlerScores=new int[noOfGooglers][3];
			
			for(int j=0;j<totalScores.length;j++){
				
				int[][] Demo=JudgedScores(totalScores[j]);
				googlerScores[j][0]=Demo[0][0];
				googlerScores[j][1]=Demo[0][1];
				googlerScores[j][2]=Demo[0][2];
				
			}
			
			googlerScores=SurpriseCheck(surprises,bestNo,googlerScores);
			int result=0;
			for(int h=0;h<googlerScores.length;h++){
				if(googlerScores[h][0]>=bestNo || googlerScores[h][0]>=bestNo || googlerScores[h][0]>=bestNo ){
					
					result++;
					
				}
			}
			
			
	       
			int Case=i+1;
	        writer.write("Case #" + Case + ": ");
		    writer.write(Integer.toString(result)); 
	       if(Case==k){} else{writer.write("\n"); }
   
			
		}
		reader.close();
		writer.close();
	}

}

