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.io.PrintWriter;
import java.util.Scanner;


public class C {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner s=new Scanner(new File("./data/B.txt"));
		PrintWriter pw=new PrintWriter(new File("./data/B_sol.txt"));
		int nCases=s.nextInt();s.nextLine();
		for(int i=0;i<nCases;i++){
			int N=s.nextInt();
			int S=s.nextInt();
			int P=s.nextInt();
			int count=0;
			
			for(int j=0;j<N;j++){
				int T=s.nextInt();
				
				boolean ok=false;
				for(int a=0;a<=10 &&!ok;a++){
					for(int b=0;b<=10&&!ok;b++){
						for(int c=0;c<=10&&!ok;c++){
							if(a+b+c==T && Math.abs(a-b)<=1 && Math.abs(a-c)<=1 && Math.abs(b-c)<=1
									&& (a>=P || b>=P || c>=P))
							{
								ok=true;
								System.out.println(a+" "+b+" "+c+" = "+T);
								
							}
						}
					}
				}
				if(ok)
					count++;
				else
				{
					boolean ok_2=false;
					for(int a=0;a<=10&&!ok_2;a++)
					{
						for(int b=0;b<=10&&!ok_2;b++){
							for(int c=0;c<=10&&!ok_2;c++)
							{
								if(a+b+c==T && Math.abs(a-b)<=2 && Math.abs(a-c)<=2 && Math.abs(b-c)<=2
										&& (a>=P || b>=P || c>=P))
								{
									ok_2=true;
									System.out.println(a+" "+b+" "+c+" = "+T);
								}
										
							}
						}
					}
					if(ok_2 && S>0){
						S--;
						count++;
					}
				}
				
			}
			pw.println("Case #"+(i+1)+": " +count);
			System.out.println("->"+i);
		}
		pw.close();
	}
}
