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.*;
import java.util.*;
class Q2
{
    public static void main(String str[])throws IOException
    {
//        FileReader fr=new FileReader("B-small-attempt0.in");
        FileReader fr=new FileReader("B-large.in");
        BufferedReader br=new BufferedReader(fr);
        FileWriter fw=new FileWriter("output.txt");
        BufferedWriter bw=new BufferedWriter(fw);
        PrintWriter pw=new PrintWriter(bw);
        int T=Integer.parseInt(br.readLine());
        for(int i=1;i<=T;i++)
        {
            String s=br.readLine();
            StringTokenizer st=new StringTokenizer(s);
            int N=Integer.parseInt(st.nextToken());
            int S=Integer.parseInt(st.nextToken());
            int p=Integer.parseInt(st.nextToken());
            int Arr[][]=new int[N][4];
            for(int j=0;j<N;j++)
            {
                int num=Integer.parseInt(st.nextToken());
                int mod=num%3;
                Arr[j][0]=mod;
                Arr[j][3]=num;
                int n=num/3;
                if(mod==0)
                {
                    Arr[j][2]=n;
                    if(n>=p)
                        Arr[j][1]=1;
                    else
                        Arr[j][1]=0;
                }
                else
                {
                     Arr[j][2]=n+1;
                     if(n+1>=p)
                        Arr[j][1]=1;
                     else
                        Arr[j][1]=0;
                }
            }
            for(int j=0;j<N;j++)
            {
                if(S==0)
                    break;
                if(Arr[j][1]==0 && (Arr[j][0]==0 || Arr[j][0]==2) && (Arr[j][2]+1)>=p && (Arr[j][2]+1)<=Arr[j][3])
                {
                    S--;
                    Arr[j][1]=1;
                }
            }
            int sum=0;
            for(int j=0;j<N;j++)
            {
                sum+=Arr[j][1];
            }
            pw.println("Case #"+i+": "+sum);
        }
        pw.close();
        bw.close();
        fw.close();
        br.close();
        fr.close();
    }
}
               
                