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 ? " *" : ""));
//    }
    
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package gcj_b;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.StringTokenizer;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author kay
 */
public class Generate {

    private BufferedReader reader;
    private StringTokenizer token;

    public void do_processing(String filename) {
        String current_line;
        int no_of_cases;
        try {
            reader = new BufferedReader(new FileReader(filename));
            FileWriter fstream = new FileWriter("G:/b_out.txt");
            BufferedWriter out = new BufferedWriter(fstream);
            no_of_cases = Integer.parseInt(reader.readLine());

            for (int i = 1; i <= no_of_cases; i++) {
                current_line = reader.readLine();
                out.write("Case #" + i + ": ");
                out.write(String.valueOf(do_generate(current_line)));
                //out.write(String.valueOf(3));
                System.out.println("outputttttttttttttttt " + do_generate(current_line));
                out.newLine();
                //Close the output stream
            }
            out.close();
            reader.close();
        } catch (Exception ex) {
            Logger.getLogger(Generate.class.getName()).log(Level.SEVERE, null, ex);
        }
    }

    public int do_generate(String line) {
        int max_num = 0, temp, remain, max=0, min=10, output = 0;
        Boolean contains = false;
        int googlers, surprises, best_value;
        token = new StringTokenizer(line);
        int triplet[] = new int[3];

        googlers = Integer.parseInt(token.nextToken());
        surprises = Integer.parseInt(token.nextToken());
        best_value = Integer.parseInt(token.nextToken());
        int scores[] = new int[googlers];

        for (int i = 0; i < scores.length; i++) {
            scores[i] = Integer.parseInt(token.nextToken());
        }

        for (int i = 0; i < scores.length; i++) {
            contains = false;
            if (scores[i] == 0){
                if(best_value ==0){
                    output++;
                }
            }else{
            temp = scores[i] / 3;
            for (int j = 0; j < triplet.length; j++) {
                triplet[j] = temp;
            }
            remain = scores[i] - (temp * 3);
            System.out.print("remain " + remain + " ");
            for (int k = 0; k < remain; k++) {
                triplet[k] += 1;
            }
            for (int k = 0; k < triplet.length; k++) {
                System.out.print(triplet[k] + " ");
            }
            System.out.println();
            
            for (int k = 0; k < triplet.length; k++) {
                    if (triplet[k] >= best_value){
                        contains = true;
                    }
                }
            if (surprises > 0 && !contains){
                if (remain == 1) {
                    triplet[1] -= 1;
                    triplet[2] += 1;
                } else {
                    triplet[0] -= 1;
                    triplet[1] += 1;
                }
            }

            for (int k = 0; k < triplet.length; k++) {
                System.out.print(triplet[k] + " ");
            }
            System.out.println();

                max = 0; min = 10; contains = false;
                for (int k = 0; k < triplet.length; k++) {
                    if(triplet[k] > max)
                        max = triplet[k];
                    if(triplet[k] < min)
                        min = triplet[k];
                }
                System.out.println("max " + max);
                System.out.println("min " + min);
                
                for (int k = 0; k < triplet.length; k++) {
                    if (triplet[k] >= best_value){
                        contains = true;
                    }
                }
                if ((max - min == 2) && contains){
                    surprises--;
                    output++;
                    System.out.println("output increase ");
                } else if(contains){
                    System.out.println("contains ");
                    output++;
                }
            
            }
            
        }
        System.out.println("output: " + output);




        return output;
    }

    public void set_suprises() {
    }
}
