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
{
	private static int max (int a, int b, int c)
	{
		return Math.max (a, Math.max (b, c));
	}
	
	public static void main (String[] args) throws IOException
	{
		BufferedReader reader = new BufferedReader (new FileReader ("input-q2.txt"));
		PrintWriter writer = new PrintWriter ("output-q2.txt");
		String line = reader.readLine();
		int nb = Integer.parseInt (line);
		for (int i = 0; i < nb; i++)
		{
			line = reader.readLine();
			String[] tokens = line.split (" ");
			int[] googlers = new int[Integer.parseInt (tokens[0])];
			int s = Integer.parseInt (tokens[1]);
			int p = Integer.parseInt (tokens[2]);
			for (int j = 0; j < googlers.length; j++)
			{
				googlers[j] = Integer.parseInt (tokens[3 + j]);
			}
			
			System.out.printf ("\ns : %d,  p : %d, googlers : %s\n", s, p, Arrays.toString (googlers));
			
			// For each googler
			int counter = 0;
			for (int j = 0; j < googlers.length; j++)
			{
				System.out.print ("Googler " + googlers[j] + " :");
				int a = 0, b = 0, c = 0;
				
				if ((googlers[j] - 2) % 3 == 0)
				{
					a = b = (googlers[j] - 2) / 3;
					c = (googlers[j] - 2) / 3 + 2;
					
					if (max (a, b + 1, c - 1) >= p || c <= 1 || max (a, b, c) < p)
					{
						System.out.printf ("  (%d %d %d)\n", a, b + 1, c - 1);
						if (max (a, b + 1, c - 1) >= p)
						{
							counter++;
						}
						continue;
					}
					else if (s > 0)
					{
						s--;
						if (max (a, b, c) >= p)
						{
							counter++;
						}
						System.out.printf ("  (%d %d %d) *\n", a, b, c);
						continue;
					}
					else
					{
						System.out.println ("ERROR");
					}
				}
				
				if ((googlers[j] - 1) % 3 == 0)
				{
					a = b = (googlers[j] - 1) / 3;
					c = (googlers[j] - 1) / 3 + 1;
					
					if (max (a, b, c) >= p)
					{
						counter++;
					}
					System.out.printf ("  (%d %d %d)\n", a, b, c);
					continue;
				}
				
				if (googlers[j] % 3 == 0)
				{
					a = b = c = googlers[j] / 3;
					
					if (max (a, b, c) >= p || b <= 1 || max (a, b - 1, c + 1) < p || s == 0)
					{
						System.out.printf ("  (%d %d %d)\n", a, b, c);
						if (max (a, b, c) >= p)
						{
							counter++;
						}
						continue;
					}
					else if (s > 0)
					{
						s--;
						if (max (a, b - 1, c + 1) >= p)
						{
							counter++;
						}
						System.out.printf ("  (%d %d %d) *\n", a, b - 1, c + 1);
						continue;
					}
					else
					{
						System.out.println ("ERROR");
					}
				}
			}
			System.out.println ("Counter : " + counter);
			writer.println ("Case #" + (i + 1) + ": " + counter);
		}
		writer.close();
		reader.close();
	}
}