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 int[] nums;
	public static int[][] memo;
	public static int p;
	public static void main(String[] args) throws IOException{
		Scanner br = new Scanner(new File("b.in"));
		PrintWriter out = new PrintWriter(new File("b.out"));
		int cases = br.nextInt();
		for(int c = 0;c<cases;c++){
			int n = br.nextInt();
			int s = br.nextInt();
			p = br.nextInt();
			nums = new int[n];
			for(int i = 0;i<n;i++){
				nums[i] = br.nextInt();
			}
			memo = new int[n][s+1];
			for(int i = 0;i<n;i++){
				Arrays.fill(memo[i], -1);
			}
			out.println("Case #"+(c+1)+": "+go(0, s));
		}
		out.close();
	}
	public static int go(int pos, int left){
		if(pos == nums.length){
			return 0;
		}
		if(left < 0){
			return -100000;
		}
		if(memo[pos][left] != -1){
			return memo[pos][left];
		}
		int best = 0;
		for(int i = 0;i<11;i++){
			for(int j = i;j<11;j++){
				int k = (nums[pos]-i)-j;
				if(k < j){
					continue;
				}
				if(k-i > 2){
					continue;
				}
				if(k-i == 2 && left > 0){
					best = Math.max(best, go(pos+1, left-1)+ (k >= p ? 1 : 0));
				}
				else if(k-i < 2){
					best = Math.max(best, go(pos+1, left)+ (k >= p ? 1 : 0));
				}
			}
		}
		return memo[pos][left] = best;
		
	}
}
