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();
	}
}

package test;
import java.io.*;

public class Test {
	
	static public void magic(String tmp, int Result [],int index ){
		int N=0,S=0,P=0,size;
		char Carr []= new char[300];
		size=tmp.length();
		tmp.getChars(0, size, Carr, 0);
		
		int i=0,j=0,spc=0;
		String bom;
		while (spc<3){
			
			if(Carr[j]!=' '){
				j++;
			}else{
				bom=tmp.substring(i, j);
				if(spc==0)
					N=Integer.parseInt(bom);
				if(spc==1)
					S=Integer.parseInt(bom);
				if(spc==2)
					P=Integer.parseInt(bom);
				spc++;
				j++;
				i=j;
			}
		}
		
		int counter=N;
		int bomnum,nosur,sur,ans=0;
		nosur=((P-1)*2)+P;
		sur=((P-2)*2)+P;
		if(sur<0)
			sur=1;
		while (counter>0){
			if(Carr[j]!=' '&&j<size){
				j++;
			}else{
				bom=tmp.substring(i, j);
				bomnum=Integer.parseInt(bom);
				if(bomnum>=nosur){
					ans++;
				}else if(bomnum>=sur && S>0){
					ans++;
					S--;
				}
				j++;
				i=j;
				counter--;
			}
		}
		
		Result[index]=ans;
		
	}
	
	public static void main(String[] args) {
		
		////////
		int index=0,T,casenum=1,j;
		String tmp;
		
		int Result[]=new int [101];
		
		////////
		
		BufferedReader reader;
		reader = new BufferedReader(new InputStreamReader(System.in));
		try {
			tmp = reader.readLine();
			T=Integer.parseInt(tmp);
			
			j=T;
			while(j!=0){
				tmp = reader.readLine();
				magic (tmp,Result,index);
				
				index++;
				j--;
			}
			
			j=T;
			while(j!=0){
				System.out.println("Case #"+casenum+": "+Result[casenum-1]);
				casenum++;
				j--;
			}
			
			
		} catch (IOException e) {
			e.printStackTrace();
		}	
	}
}
