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.util.*;
import java.io.*;

public class B  {
	public static void main (String [] args) {
		try {
			BufferedReader br = new BufferedReader(new FileReader("B-large-0.in"));
			PrintWriter pw = new PrintWriter("B-large-0.out");
			int inputNo;
			inputNo = Integer.parseInt(br.readLine());

			for (int i = 1; i <= inputNo; i++) {
				// get one input here
				String in = br.readLine();
				pw.println("Case #" + i + ": " + processInput(in));
			}

			br.close();
			pw.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	public static int processInput(String in) {
		int result = 0;

		Scanner sc = new Scanner(in);
		int gNo = Integer.parseInt(sc.next());
		int sup = Integer.parseInt(sc.next());
		int max = Integer.parseInt(sc.next());
		int supNo = 0;
		int goodNo = 0;

		for (int i = 0; i < gNo; i++) {
			int total = Integer.parseInt(sc.next());
			int can = canMax(max, total);
			if (can == 1) supNo++;
			if (can == 0) goodNo++;
		}

		if (supNo > sup) result = goodNo + sup;
		else result = goodNo + supNo;

		return result;
	}

	public static int canMax(int max, int total) {
		int av = total/3;
		int r = total%3;
		if (r == 0) {
			if (av >= max) return 0;
			if (av+1 >= max && av+1 <= 10 && av-1 >= 0) return 1;
			return -1;
		}
		if (r == 1) {
			if (av+1 >= max && av + 1 <= 10) return 0;
			return -1;
		}
		if (r == 2) {
			if (av+1 >= max && av+1 <= 10) return 0;
			if (av+2 >=max && av+2 <= 10) return 1;
			return -1;
		}

		return -1;
	}
}
