/*
 * 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.util.ArrayList;
import java.util.List;


public class Dancers implements Solver {
	int N;
	int S;
	int p;
	List<Integer> dan = new ArrayList<Integer>();
	

	public Dancers(List<String> lineas) {
		String[] cosa = lineas.get(0).split(" ");
		N=Integer.parseInt(cosa[0]);
		S=Integer.parseInt(cosa[1]);
		p=Integer.parseInt(cosa[2]);
		for (int i=0; i<N; i++){
			dan.add(Integer.parseInt(cosa[i+3]));
		}
		// TODO Auto-generated constructor stub
	}


	@Override
	public String solve() {
		int conta=0;
		for (int i=0; i<N; i++){
			if (dan.get(i)>=p+p-1+p-1 && dan.get(i)>=p){
				conta++;
			}
			else if(dan.get(i)>=p+p-2+p-2 && dan.get(i)>=p && S>0){
				conta++;
				S--;
			}
		}
		// TODO Auto-generated method stub
		return conta+"";
	}

}
