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

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

import java.io.File;
import java.lang.StringBuilder;
import java.util.Scanner;
import java.io.FileWriter;
import java.util.ArrayList;
import java.lang.Math;
import java.util.Collections;

public class DWTG {
	
	public static void main(String[] args) throws Exception{
		File input = new File("B-small-attempt2.in");
		File output = new File("output.out");
		FileWriter fw = new FileWriter(output);
		Scanner s = new Scanner(input);
		
		int numloops = s.nextInt();
		StringBuilder sb = new StringBuilder();
		
		for(int n=0; n<numloops; n++){
			sb.append("Case #" + (n+1) + ": ");
			//System.out.println("Case: " + (n+1));
			int numGooglers = s.nextInt();
			int numSurprises = s.nextInt();
			int minscore = s.nextInt();
			int maxwithscore = 0;
			
			ArrayList<Integer> al = new ArrayList<Integer>();
			
			for(int i=0; i<numGooglers; i++){
				int curnum = s.nextInt();
				
				//System.out.println("Curnum: "+curnum+" ceil: "+Math.ceil(((float)curnum)/3));
				if(Math.ceil(((float)curnum)/3) >= minscore){
					//System.out.println("Added "+Math.ceil(((float)curnum)/3)+" "+minscore);
					maxwithscore++;
					continue;
				}
				
				if(curnum == 0)
					continue;
				
				if((int) Math.ceil(((float)curnum)/3) == curnum/3){
					al.add( (int) Math.ceil(((float)curnum)/3) +1);
					//System.out.println((int) Math.ceil(((float)curnum)/3) +1);
				} else{
					al.add( (int) Math.ceil(((float)curnum)/3));
					//System.out.println( Math.ceil(((float)curnum)/3));
				}
			}
			
			Collections.sort(al);
			Collections.reverse(al);
			
			int i=numSurprises;
			
			while(i>0 && !al.isEmpty()){
				int curnum = al.get(0);
				
				curnum++;
				
				//System.out.println(curnum + " " +minscore);
				
				if(curnum >= minscore){
					maxwithscore++;
				}
				
				al.remove(0);
				i--;
			}
			
			sb.append(maxwithscore + "\n");
		}
		
		fw.write(sb.toString());
		//System.out.println(sb.toString());
		fw.close();
	}
}
