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

/**
 * 
 */
package google.exercise.b;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

/**
 * @author tomtom
 * 
 */
public class B {

    private static Scanner in;
    private static PrintWriter out;
    private static int nbCase;

    private static class Solver {

	private int currentNbMax;
	private int currentNbMin;
	private int treshold;
	private int nbGooglers;
	private List<Integer> scores;
	private int nbSurprise;

	public void solve() {
	    for (int i = 1; i <= nbCase; i++) {
		out.printf("Case #%d: %s%n", i, doSolve());
		in.nextLine();
	    }
	}

	private int doSolve() {
	    int nbGoodScorer = 0;
	    scores = new ArrayList<Integer>();
	    nbGooglers = in.nextInt();
	    nbSurprise = in.nextInt();
	    treshold = in.nextInt();
	    currentNbMax = treshold * 3 - 2;
	    currentNbMin = ((treshold - 2) < 0 ? 0 : treshold - 2) * 2
		    + treshold;

	    for (int i = 0; i < nbGooglers; i++) {
		scores.add(in.nextInt());
	    }

	    Collections.sort(scores);
	    Collections.reverse(scores);

	    for (Integer score : scores) {
		if (score >= currentNbMax) {
		    nbGoodScorer++;
		} else if (score < currentNbMax && score >= (currentNbMax - 2)) {
		    if (nbSurprise > 0) {
			nbSurprise--;
			if (score >= treshold) {
			    nbGoodScorer++;
			}
		    }
		}
	    }

	    return nbGoodScorer;
	}

    }

    /**
     * @param args
     * @throws FileNotFoundException
     */
    public static void main(String[] args) throws FileNotFoundException {
	in = new Scanner(new File(
		"/Users/tomtom/Desktop/jam-2012/input-B/B-large.in"));
	out = new PrintWriter(new FileOutputStream(
		"/Users/tomtom/Desktop/jam-2012/input-B/B-large.out"));

	nbCase = in.nextInt();
	in.nextLine();

	new Solver().solve();

	in.close();
	out.close();
    }
}
