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.*;
import java.util.*;

public class B{
	public static ArrayList<Case> cases = new ArrayList<Case>();
	public static void main (String [] args){
		
		parseFile();
		for(int i=0; i<cases.size(); i++){
			//System.out.print(cases.get(i).n +" ");
			//System.out.print(cases.get(i).s +" ");
			//System.out.print(cases.get(i).p +" ");
			//for(int j=0; j< cases.get(i).totals.size(); j++){
				//System.out.print(cases.get(i).totals.get(j) + " ");
			//}
			System.out.println("Case #" +(i+1)+": " + play(cases.get(i)));
		}
		
	}
	
	static void parseFile(){
		BufferedReader br = null;
		try{
			br = new BufferedReader(new FileReader("b-large.in"));
			int caseCnt = Integer.parseInt(br.readLine());
			ArrayList<String> al = null;
			StringTokenizer st = null;
			
			for(int i=0; i<caseCnt; i++){
				al = new ArrayList<String>();
				st = new StringTokenizer(br.readLine());
				while (st.hasMoreTokens()) {
					al.add(st.nextToken());
				}
				
				Case c = new Case();
				c.n = Integer.parseInt(al.get(0));
				c.s = Integer.parseInt(al.get(1));
				c.p = Integer.parseInt(al.get(2));				
				for(int j=3; j<al.size(); j++){
					c.totals.add(al.get(j));
				}
				cases.add(c);
			}
		}catch(IOException ioe){
			try{br.close();}catch(Exception e){}
		}
	}
	
	static int play(Case c){
		int nLimit = c.p *3 - 2;
		if(nLimit < 0){nLimit = 0;}

		int ans = 0;
		//System.out.println("nLimit="+nLimit);
		for(int i=0; i<c.totals.size(); i++){
			int total = Integer.parseInt(c.totals.get(i));
			if (c.p ==0){ans ++; continue;}
			if (c.p >0 && total == 0){continue;}
			if(c.p ==1 && total>0){ans ++; continue;}
			//System.out.println("total="+total);
			if(total>= nLimit){
				ans ++;
			}else if((total == (nLimit-1))||(total == (nLimit-2))){
				if (c.s <=0){
				}else{
					ans ++;
					c.s --;
				}
			}
		}
		return ans;
	}
	
	static class Case{
		int n;
		int s;
		int p;
		ArrayList<String> totals = new ArrayList <String>();
	}
} 
