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

package Qualification;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;

public class B {
	public static void main(String[] args) throws IOException{
		BufferedReader in = new BufferedReader(new FileReader(new File("C:\\Users\\braidon\\Desktop\\CodeJam\\B-large.in")));
		FileWriter out = new FileWriter(new File("C:\\Users\\braidon\\Desktop\\CodeJam\\B-large.out"));
		//BufferedReader in = new BufferedReader(new FileReader(new File("C:\\Users\\braidon\\Desktop\\CodeJam\\B-small.in")));
		//FileWriter out = new FileWriter(new File("C:\\Users\\braidon\\Desktop\\CodeJam\\B-small.out"));
		
		int N = new Integer(in.readLine());
		
		for(int c = 1; c <= N; c++){
			int resp = 0;
			String[] sin = in.readLine().split(" ");
			int n = Integer.parseInt(sin[0]);
			int s = Integer.parseInt(sin[1]);
			int p = Integer.parseInt(sin[2]);
			int[] t = new int[n];
			int[] m = new int[n];
			for(int c1 = 3; c1 <= sin.length-1; c1++){
				t[c1-3] = Integer.parseInt(sin[c1]);
			}
			Arrays.sort(t);
			for(int c1 = 3; c1 <= sin.length-1; c1++){
				int ti = t[c1-3];
				m[c1-3] = 0;
				if(ti != 0){
					if(s > 0){
						int a1 = ti/3;
						int a2 = 0;
						if(a1 + 2 <= 10){
							a2 = a1 + 2;
						}else{
							a2 = 10;
							a1 = 8;
						}
						if((a1+a2+a1 == ti)||
								(a1+a2+a2 == ti)||
								(a1+a2+a2-1 == ti)){
							m[c1-3] = a2;
							if(a2 < p){
								m[c1-3] = 0;
							}else{
								s -= 1;
							}
						}
						if(m[c1-3] == 0){
							a1 -= 1;
							a2 = a1 + 2;
							if((a1+a2+a1 == ti)||
									(a1+a2+a2 == ti)||
									(a1+a2+a2-1 == ti)){
								m[c1-3] = a2;
								if(a2 < p){
									m[c1-3] = 0;
								}else{
									s -= 1;
								}
							}
						}
					}
					if(m[c1-3] == 0){
						int a1 = ti/3;
						if(ti%3 == 0){
							m[c1-3] = a1;
						}
						else{
							m[c1-3] = a1+1;
						}
					}
				}
				if(m[c1-3] >= p){
					resp += 1;
				}
			}
			out.write("Case #" + c + ": " + resp + "\n");
		}
		out.flush();
		out.close();
	}
	static void inverter(int[] b){
		int left = 0;
	    int right = b.length-1;
	  
	    while (left < right) {
	      int temp = b[left]; 
	      b[left]  = b[right]; 
	      b[right] = temp;
	     
	      left++;
	      right--;
	    }
	}
}
