package code12.qualification;

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

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

import java.io.*;
import java.util.*;
public class Q2{
  static Map<Integer, Integer> m1 = new HashMap<Integer, Integer>();
  static Map<Integer, Integer> m2 = new HashMap<Integer, Integer>();
  static {
    for (int i = 0;i<31;i++){
      m1.put(i, max1(i)); 
      m2.put(i, max2(i)); 
    }
  }
  private static int max1(int i){
    if (i % 3 == 0) {
      return i/3;
    } else if (i%3 == 1){
      return i/3 + 1;
    } else {
      return i/3 + 1;
    } 
  }
  private static int max2(int i){
    if (i == 0) return 0;
    if (i % 3 == 0) {
      return i/3 + 1;
    } else if (i%3 == 1){
      return i/3 + 1;
    } else {
      return i/3 + 2;
    } 
  }
  public static void main(String args[]){
    try {
      BufferedReader is = new BufferedReader(
        new InputStreamReader(new FileInputStream(new File("B-large.in"))));
      BufferedWriter os = new BufferedWriter(
        new OutputStreamWriter(new FileOutputStream(new File("q2output.txt"))));

      int num = Integer.parseInt(in(is));

      for (int i=0;i<num;i++){
        String s = in(is);

        
        String o = answer(s);


        p("Case #" + (i + 1) + ": " + o, os);

      }
      is.close();
      os.close();
    }catch(Exception e){
      e.printStackTrace();
    }
  }

  private static String in(BufferedReader is) throws IOException{
    return is.readLine();
  }

  private static void p(String n, String w){
    System.out.println(n + ":" + w);
  }

  private static void p(String w) {
    System.out.println(w);
  }

  private static void p(String w, BufferedWriter os) throws IOException{
    os.write(w);
    os.newLine();
  }

  private static String answer(String s) {
    StringTokenizer st = new StringTokenizer(s);
    int num = Integer.parseInt(st.nextToken());
    int spr = Integer.parseInt(st.nextToken());
    int min = Integer.parseInt(st.nextToken());

    int result = 0;
    for (int i = 0;i<num;i++) {
      int score = Integer.parseInt(st.nextToken());
      int max = m1.get(score);
      if (max >= min) {
        result++;
      } else {
        max = m2.get(score);
        if (max >= min) {
          result++;
          spr--;
        }
      }
    }
    return "" + (result + ((spr < 0)?spr:0));
  }
}

