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.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Scanner;


public class ProblemB {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(new File(args[0]));
		int numberOfLines = Integer.parseInt(sc.nextLine());
		Scanner lineScan;
		int numberOfPeople =0, numberOfSurprising = 0, bestRes = 0;
		ArrayList<ArrayList<Integer>> list = new ArrayList<ArrayList<Integer>>();
		ArrayList<Integer> triple;
		
		int score, count = 0;
		String line = " ";
		
		for (int i=0; i<numberOfLines;i++)
		{
			count = 0;
			line = sc.nextLine();
			lineScan = new Scanner(line);
			numberOfPeople = lineScan.nextInt();
			numberOfSurprising = lineScan.nextInt();
			bestRes = lineScan.nextInt();
			
			for (int j = 0; j< numberOfPeople; j++)
			{
				score = lineScan.nextInt();
				triple = new ArrayList<Integer>();
				if (score % 3 == 0)
				{
					
					if (score/3 < bestRes && score/3 + 1 >= bestRes && score > 0 && numberOfSurprising > 0)
					{
						triple.add(score/3 -1);
						triple.add(score/3);
						triple.add(score/3 +1);
						numberOfSurprising --;
					}
					else
					{
						for (int k = 0; k<3; k++)
							triple.add(score/3);
					}
					list.add(triple);
				}
				else
				{
					double mean = (double) score /3;
					double boundary = score/3 +0.5;
					if (mean > boundary )
					{
						if (score/3 + 2 == bestRes && numberOfSurprising >0)
						{
							triple.add(score/3);
							triple.add(score/3);
							triple.add(score/3 +2);
							numberOfSurprising--;
						}
						else
						{
							triple.add(score/3);
							triple.add(score/3 +1);
							triple.add(score/3 + 1);
						}
							
					}
					else
					{
						triple.add(score/3);
						triple.add(score/3);
						triple.add(score/3 +1);
					}
					
					list.add(triple);
						
					
				}
			}
			
			//System.out.println("Line " + line);
			for (ArrayList<Integer> tri: list)
			{
				if (tri.get(tri.size()-1) >= bestRes)
					count++;
				
			}

			System.out.printf("Case #%d: %d\n", i+1, count);
			
			list.clear();
							
		}
	}

}
