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.lang.*;
import java.util.*;
import java.io.*;
class codejam2
{
	public static boolean check(int[] ar){
		if(ar[2]-ar[1]<3 && ar[2]-ar[0]<3 && ar[0]>=0) return true;
		else return false;
	}

	public static boolean sur(int[] ar){
		if(ar[2]-ar[0]==2) return true;
		else return false;
	}

	public static int mainHelper(int n1,int s1,int p1,int[] p2){
		int n=n1;
		int s=s1;
		int p=p1;
		int ans=0;
		int[] points=p2;
		int[][] a =new int[n+1][3];
		for(int i=1;i<=n;i++){
			for(int j=0;j<3;j++){
				a[i][j]=points[i]/3;
			}
			if(points[i]%3==1) a[i][2]+=1;
			else if(points[i]%3==2){
				a[i][2]+=1;
				a[i][1]+=1;
			}
			
		}
		java.util.Arrays.sort(a[1]);
		for(int i=1;i<=n;i++){
			while(check(a[i])){
				if(a[i][2]>= p){
					if(sur(a[i])){
						if(s>0){ s-=1; ans+=1;}
						}
					else ans+=1;
					break;
				}
				else{
					int[] temp=a[i];
					temp[2]+=1;
					temp[1]-=1;
					java.util.Arrays.sort(temp);
					if(check(temp)) a[i]=temp;
					else break;

				}
			}
		}
		return ans;

	}

	public static void main(String[] args) 
	{
		//N S p .......3 1 5 15 13 11
		try{
			BufferedReader in=new BufferedReader(new FileReader("input2.txt"));
			BufferedWriter out=new BufferedWriter(new FileWriter("output2.txt"));
			int z=Integer.parseInt(in.readLine());
			for(int j=0;j<z;j++){
				String str=in.readLine();
				StringTokenizer st=new StringTokenizer(str);
				int n=Integer.parseInt(st.nextToken());
				int s=Integer.parseInt(st.nextToken());
				int p=Integer.parseInt(st.nextToken());
				int[] p2=new int[n+1];
				for(int i=1;i<=n;i++){
					p2[i]=Integer.parseInt(st.nextToken());
				}
				out.write("Case #"+(j+1)+": "+mainHelper(n,s,p,p2)+"\n");
			}
			out.close();
			in.close();
		}
		catch(IOException e){}


	}
}
