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.StringTokenizer;

/**
 * Created by IntelliJ IDEA.
 * User: marcus
 * Date: 4/13/12
 * Time: 8:18 PM
 * To change this template use File | Settings | File Templates.
 */
public class DancingGooglers {
    public static void main(String a[]) throws IOException {

        int T = 0;
        FileInputStream fInputstream = null;
        try {
            fInputstream = new FileInputStream("B-large.in");
        } catch (FileNotFoundException e) {
            //e.printStackTrace();  //To change body of catch statement use File | Settings | File Templates.
        }
        DataInputStream in = new DataInputStream(fInputstream);
        BufferedReader br = new BufferedReader(new InputStreamReader(in));
        String strLine;

        FileWriter fstream = new FileWriter("B-large.out");
        BufferedWriter out = new BufferedWriter(fstream);

        String strT = null;
        strT = br.readLine();

        T =  Integer.parseInt(strT);



        for(int i = 1; i <= T; i++)  {
            String testCase =  br.readLine();
            StringTokenizer st = new StringTokenizer(testCase, " ");

            int N = Integer.parseInt(st.nextToken());
            int S = Integer.parseInt(st.nextToken());
            int p = Integer.parseInt(st.nextToken());

            //System.out.println("Number of Googlers: " + N);
            //System.out.println("Number of Surprises: " + S);
            //System.out.println("Great to have: " + p);

            int result = 0;

            int []  markSheet = new int[N];
            for(int j = 0; j < N; j++){
                markSheet[j] = Integer.parseInt(st.nextToken());
            }

            for (int k = 0; k < N; k++){
                int minValue =  p > 1 ? ((p -1) * 3): p;
                //System.out.println("Min Value : " + minValue);

                if(markSheet[k] >= p ){
                    if(p == 0 && markSheet[k] >= 0){    // m = 0
                        result++;

                    } else if(markSheet[k] > p && p <= 1){  // m = 1, 2

                        result++;

                    }else if(markSheet[k] > ((p -1) * 3)){
                        result++;
                    } else if(S > 0){
                        if(markSheet[k] == ((p -1) * 3)){
                            result++;
                            S--;
                        } else {
                            int rem = markSheet[k] % 3;
                            int val =  markSheet[k] / 3;
                            if(rem > 1){
                                if((val + 2) >= p){
                                    result++;
                                    S--;
                                }
                            } else {
                                if((val + 1) >= p){
                                    result++;
                                    S--;
                                }
                            }
                        }
                    }
                }
            }

            System.out.println("Case #" + i +  ": " + result);
            System.out.println("S: " + S);

            out.write("Case #" + i + ": " + result + "\n");
        }

        in.close();
        out.close();
    }


}
