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 javax.swing.*;
import java.util.Scanner;
import java.io.*;


public class ProblemCSmall {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		
		String [] VectorString= new String [100];
		String chingon="";
		int T=0,N=0,S=0,P=0,i,X,Y,Z,u=0;
		
		Scanner leer;
		PrintWriter escribir;
		
		for(i=0; i<100; i++)
		{
			VectorString[i]="Case #"+(1+i)+": ";
		}
		try
		{
			leer = new Scanner(new File("/Users/joseandresfelixchavez/Documents/CETYS/3er Semestre/Sistemas Operativos/GoogleCodeJam/src/leee.txt"));
			escribir = new PrintWriter(new BufferedWriter(new FileWriter("/Users/joseandresfelixchavez/Documents/CETYS/3er Semestre/Sistemas Operativos/GoogleCodeJam/src/escribe.txt")));
			
			T=Integer.parseInt(leer.nextLine());
			for(int caca=1; caca<=T; caca++)
			{
				
				N=leer.nextInt();
				System.out.print(N);
				S=leer.nextInt();
				P=leer.nextInt();
				int [] vector= new int [N];
				for(i=0; i<N; i++)
				{
					vector[i]=leer.nextInt();
				}
			
			
			int temp =0;
            for ( i = 0; i < vector.length-1; i++)
            {
                for(int k = i+1; k < vector.length;k++)
                {
                    if(vector[k]<vector[i])
                    {
                        temp = vector[k];
                        vector[k]=vector[i];
                        vector[i]=temp;
                    }

                }
            }

            int total = 0;
            Z=P+(P-2)+(P-2);//ZZ
            Y=P+(P-1)+(P-2);//ZX
            X=P+(P-1)+(P-1);//Z

            for (int K = vector.length - 1; K >= 0; K--)
            {
                if(vector[K] >= X  &&  vector[K]>=P)
                {
                    total++;
                    continue;
                }

                if (vector[K] >= Y && S > 0 && vector[K] >= P)
                {
                    total++;
                    S--;
                    continue;
                }
                if (vector[K] >= Z && S > 0 && vector[K] >= P)
                {
                    total++;
                    S--;
                    continue;
                }
                
            }
            VectorString[u]=VectorString[u]+total;
            chingon+=VectorString[u]+"\r\n";
            if(leer.hasNextLine())
            {u++;}
			}
            System.out.print(chingon);
            escribir.print(chingon);
			/*for(i=0; i<T; i++)
			{
				escribir.println(VectorString[N]);
			}*/
			escribir.close();
			
		}
		catch(FileNotFoundException error)
		{
			System.out.println("no se encuentra el archivo");
		}
		catch (EOFException e)
		{
		    System.out.println("Final de Stream");
		}
	}
}

