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.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class Test {

	public static void main (String[] arg) throws IOException{
		
		 Scanner sc;
	        
	        PrintWriter pWriter = null;
	        
	        try {
	        BufferedWriter bw = new BufferedWriter(new FileWriter("B.out"));
			pWriter = new PrintWriter(bw);
			
	        sc = new Scanner(new File("B-large.in"));
	        
	        int T = sc.nextInt();
	        //System.out.println("T = " +T);
	        
	        int max = 30 , min , lim1 , lim2 ;
	        
	        for(int i=1; i<=T; i++){
	        	//Scanner sc2 = new Scanner(sc.nextLine());
	        	int N = sc.nextInt(), S = sc.nextInt(), P = sc.nextInt();
	        	//System.out.println("N = " +N+ "S = " +S+ "P = " +P);
	        	
	        	min = P * 3 - 2 ;
	        	lim1 = P * 3 - 3;
	        	lim2 = P * 3 - 4;
	        	int somme = 0;
	        	
	        	for(int j = 0 ; j < N ; j++){
	        		int t = sc.nextInt();
	        		if(t >= P){
		        		if(t <= max && t >= min)	somme++;
		        		if(t == lim1 && S > 0)		{	somme++;	S--;	}
		        		if(t == lim2 && S > 0)		{	somme++;	S--;	}
		        	}
	        	}
	        	
	        	//System.out.println("Case: #" +i+ " "+somme);
	        	pWriter.println("Case #" +i+ ": "+somme);
	        }
	        
	        /*
	        int i=0;
	        
	           while(sc.hasNext()){
	        	   String l = "", ligne = sc.nextLine();
	        	   
	        	   //System.out.println("in="+ligne);
	        	   
	        	   Scanner sc2 = new Scanner(ligne);
	        	   sc2.useDelimiter(" ");
	        	   
	        	   while(sc2.hasNext()){
	        		   if(!l.equals(""))
	        			   l = sc2.next() +" "+l;
	        		   else
	        			   l = sc2.next();
	        	   }
	        	   
	        	   //System.out.println("out="+l);
	        	   if(i != 0)
	        	   pWriter.println("Case #"+i+++": "+l);
	        	   else i++;
	        	   
	           }*/
	        } catch (FileNotFoundException e) {
	        		e.printStackTrace();

	        }finally{
	        	//System.out.println("out");
	        	pWriter.close() ;
	        }
		
	}
}
