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.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.ArrayList;


public class GJ_QR_B {

    public static int solve(int N, int S, int p, int[] t){
        int[][] s = new int[31][2];
        for (int i=0; i<31; i++){
            if(i%3 == 0){
                if (3*p <= i) s[i][0] = 1;
                if ( (p>=2 && 3*(p-1) == i) || 3*(p-1) < i) s[i][1] = 1;
            }
            if(i%3 == 1){
                if ( (p>=1 && 3*p-2 == i) || 3*p-2 < i) s[i][0] = 1;
                if ( (p>=2 && 3*p-2 == i) || 3*p-2 < i) s[i][1] = 1;
            }
            if(i%3 == 2){
                if ( (p>=1 && 3*p-1 == i) || 3*p-1 < i) s[i][0] = 1;
                if ( (p>=2 && 3*p-4 == i) || 3*p-4 < i) s[i][1] = 1;
            }
            //System.out.println(i+":"+s[i][0]+"+"+s[i][1]);
        }
        ArrayList<Integer> a01 = new ArrayList<Integer>();
        ArrayList<Integer> a11 = new ArrayList<Integer>();
        ArrayList<Integer> a10 = new ArrayList<Integer>();
        ArrayList<Integer> a00 = new ArrayList<Integer>();
        for (int i=0; i<t.length; i++){
            if (s[t[i]][0] == 1 && s[t[i]][1] == 0)
                a10.add(i);
            if (s[t[i]][0] == 0 && s[t[i]][1] == 1)
                a01.add(i);
            if (s[t[i]][0] == 1 && s[t[i]][1] == 1)
                a11.add(i);
            if (s[t[i]][0] == 0 && s[t[i]][1] == 0)
                a00.add(i);
            /*
            if (s[t[i]][0] == 1) 
                System.out.println("  "+t[i]+":"+p+":");
            if (s[t[i]][1] == 1) 
                System.out.println("  "+t[i]+":"+p+":(*)");
                */
        }
        int res = a11.size();
        if (S <= a01.size())
            res += S + a10.size();
        else if (S <= a01.size() + a11.size())
            res += a01.size() + a10.size();
        else 
            res += a01.size()+ a10.size() ;
            
        System.out.println("N="+N+", S="+S+" : (a01)"+a01.size()+" : (a11)"+a11.size()+" : (a10)"+a10.size()+" : (a00)"+a00.size() + " ==> "+ res);
            
        return res;
    }
    

    public static void main(String[] args) throws NumberFormatException, IOException {
        java.io.BufferedReader stdin = new java.io.BufferedReader(new java.io.InputStreamReader(new FileInputStream("B-large.in")));
        java.io.BufferedWriter stdout = new java.io.BufferedWriter(new OutputStreamWriter(new FileOutputStream("B-large.out")));
        int T = Integer.parseInt(stdin.readLine());
        //T = 1;
        for (int ii=0; ii<T; ii++){
            String str = stdin.readLine();
            String[] words = str.split(" ");
            int N = Integer.parseInt(words[0]);
            int[] in = new int[N];
            for (int j = 0; j<N; j++)
                in[j] = Integer.parseInt(words[3+j]);
            
            System.out.print("Case #" + (1+ii) +" ");
            int res = solve(N, Integer.parseInt(words[1]), Integer.parseInt(words[2]), in);

            stdout.write("Case #" + (1+ii)+": " +res+'\n');
        }
        stdout.close();
    }

}
