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);
		
		
		
	}
}

package com.codejam;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class ProblemB {

    public static void main(String[] args) throws FileNotFoundException {

        Scanner sc = new Scanner(new File("B-small-attempt0.in"));
        int T = sc.nextInt();
        sc.nextLine();

        for (int i = 0; i < T; i++) {
            int N = sc.nextInt();
            int S = sc.nextInt();
            int p = sc.nextInt();

            int[] t = new int[N];
            for (int j = 0; j < N; j++) {
                t[j] = sc.nextInt();
            }

            System.out.println("Case #" + (i + 1) + ": " + solve(N, S, p, t));

        }

    }

    private static int solve(int N, int S, int p, int[] t) {

        int countA = 0, countB1 = 0, countB2 = 0, countC1 = 0, countC2 = 0, count = 0;
        for (int i = 0; i < N; i++) {
            int r = t[i] % 3, d = t[i] / 3;
            switch (r) {
            case 1:
                if (d + 1 >= p) {
                    countA++;
                }
                break;
            case 0:
                if (d == 0) {
                    if (d >= p) {
                        countB1++;
                    }
                } else if (d >= 10) {
                    if (d >= p) {
                        countB1++;
                    }
                } else if (d >= p) {
                    countB1++;
                } else if (d + 1 == p && d > 0) {
                    countB2++;
                }
                break;
            case 2:
                if (d >= 9) {
                    if (d + 1 >= p) {
                        countC1++;
                    }
                } else if (d + 1 >= p) {
                    countC1++;
                } else if (d + 2 == p) {
                    countC2++;
                }
                break;
            default:
                break;
            }
        }

        count = countA + countB1 + countC1 + Math.min(countB2 + countC2, S);
        return count;
    }

}
