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 dance
{
	public static void main(String[] args) throws Exception
	{
		BufferedReader in = new BufferedReader(new InputStreamReader(new FileInputStream(new File("dance.in"))));
		PrintStream out = new PrintStream(new File("dance.out"));
		int cases = Integer.parseInt(in.readLine());
		StringTokenizer s1;
		int quant, surp, score, specnum1, specnum2, total, surpcount, with, without;
		int[] scores;
		for(int x = 0; x < cases; x++){
			s1 = new StringTokenizer(in.readLine(), " ");
			quant = Integer.parseInt(s1.nextToken());
			surp = Integer.parseInt(s1.nextToken());
			score = Integer.parseInt(s1.nextToken());
			scores = new int[quant];
			total = 0;
			surpcount = 0;
			for(int y = 0; y < quant; y++){
				scores[y] = Integer.parseInt(s1.nextToken());
				with = maxWith(scores[y]);
				without = maxWithout(scores[y]);
				if(without >= score)
					total++;
				else if(surpcount < surp){
					if(with >= score){
						total++;
						surpcount++;
					}
				}
			}
			out.println("Case #" + (x+1) + ": " + total);
		}
	}
	public static int maxWith(int num)
	{
		int base = num/3;
		int rem = num%3;
		if(num == 0)
			return 0;
		else if(rem == 0)
			return (base+1);
		else if(rem == 1)
			return (base+1);
		else
			return (base+2);
	}
	public static int maxWithout(int num)
	{
		int base = num/3;
		int rem = num%3;
		if(rem == 0)
			return base;
		else
			return (base+1);	
	}
}