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.*;

public class ProblemB {
	public static void main(String[] args) {
		System.out.println("Enter input for case:");
		
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		sc.nextLine();
		
		int[] nt = new int[T];
		int[] st = new int[T];
		int[] pt = new int[T];
		int[][] ni = new int[T][];
		for (int t = 0; t < T; t++) {
			nt[t] = sc.nextInt();
			st[t] = sc.nextInt();
			pt[t] = sc.nextInt();
			ni[t] = new int[nt[t]];
			for (int j = 0; j < nt[t]; j++)
				ni[t][j] = sc.nextInt();
			sc.nextLine();
		}
		
		
		for (int t = 1; t <= T; t++) {
			int n = nt[t-1]; //number of Googlers
			int s = st[t-1]; //number of surprising triplets of scores
			int p = pt[t-1]; //minimum best result
			int sUsedUp = 0;
			int result = 0;
			
			for (int totalPoints : ni[t-1]) {
				if (totalPoints >= p*3 - 2)
					result++;
				if (p > 1)
					if (totalPoints == p*3 - 4 || totalPoints == p*3 - 3)
						if (sUsedUp < s) {
							result++;
							sUsedUp++;
						}
			}
			
			System.out.println("Case #" + t +": " + result);
		}
		
		

	}

}
