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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;


public class DancingWithTheGooglers {
	public static void main(String[] args) {
		 try {
	            // t@CIuWFNgð¶¬·é
	            FileInputStream fileInputStream =
	                new FileInputStream("B-large.in");
	            InputStreamReader inputStreamReader =
	                new InputStreamReader(fileInputStream);
	            BufferedReader bufferedReader =
	                new BufferedReader(inputStreamReader);
	            // t@C©çêsÇÝæé
	            String lines = bufferedReader.readLine();
	            int len = Integer.parseInt(lines);
	            String[] str = new String[len];
	            for(int i = 0; i < len; i++){
	            	str[i] = bufferedReader.readLine();
	            }

	            // t@CIuWFNgðjü·é
	            bufferedReader.close();
	            inputStreamReader.close();
	            fileInputStream.close();


	            FileOutputStream fileOutputStream =
	                new FileOutputStream("answerDWG.txt");
	            OutputStreamWriter outputStreamWriter =
	                new OutputStreamWriter(fileOutputStream);
	            BufferedWriter bufferedWriter =
	                new BufferedWriter(outputStreamWriter);
	            //\bhú»
	            DancingWithTheGooglers dwg = new DancingWithTheGooglers();
	            for(int i = 0; i < len; i++){
	            	bufferedWriter.write("Case #" + (i+1) + ": " + dwg.keisan(str[i]) + "\n");
	            	// t@CÉàeð«Þ
	            }
	            // t@CIuWFNgðjü·é
	            bufferedWriter.close();
	            outputStreamWriter.close();
	            fileOutputStream.close();


	        // êAÌt@CÍIOExceptionª­¶·é
	        } catch (IOException ex) {
	            ex.printStackTrace();
	        }
	}
	
	private int keisan(String str){
		String[] inp = str.split(" ",-1);
		int i;
		int N = Integer.parseInt(inp[0])+3;
		int S = Integer.parseInt(inp[1]);
		int p = Integer.parseInt(inp[2]);
		int cnt = 0;
		int s_cnt = 0;
		for(i=3;i<N;i++){
			int ttl = Integer.parseInt(inp[i]);
			int a = ttl/3;
			int b = ttl%3;
			if(a >= p){
				cnt++;
			} else if(a == p-1){
				if(b > 0){
					cnt++;
				} else {
					if(a > 0 && s_cnt < S){
						cnt++;
						s_cnt++;
					}
				}
			} else if(a == p-2){
				if(b == 2 && s_cnt < S){
					cnt++;
					s_cnt++;
				}
			}
		}
		return cnt;	
	}

}
