import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

import java.io.*;
import java.util.ArrayList;
import java.util.Scanner;

public class QualificationRoundB {
    public static void main(String[] args) throws IOException {
        String inFile = args[0];
        String outFile = inFile.replaceAll("\\.in$", ".out");

        Scanner scanner = new Scanner(new FileInputStream(inFile));
        int cases = scanner.nextInt();

        FileWriter fileWriter = new FileWriter(outFile);
        BufferedWriter bufferedWriter = new BufferedWriter(fileWriter);
        for(int c = 1; c <= cases; c++){
            bufferedWriter.write(String.format("Case #%d: ", c));
            int N = scanner.nextInt();
            int S = scanner.nextInt();
            int p = scanner.nextInt();
            int t[] = new int[N];
            for(int n = 0; n < N; n++)
                t[n] = scanner.nextInt();

            int count = 0;
            int midTop = 3*p - 3;
            int midBot = 3*p - 4;
            for(int n = 0; n < N; n++){
                switch(p){
                    case 0:
                    case 1:
                        if(t[n] >= p)
                            count++;
                        break;
                    default:
                        if(t[n] > midTop){
                            count++;
                        }
                        else if(t[n] >= midBot && S > 0){
                            S--;
                            count++;
                        }
                }
            }
            System.out.println(String.format("%d", count));
            bufferedWriter.write(String.format("%d\n", count));
        }
        bufferedWriter.close();
        fileWriter.close();
    }
}
