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.*;

public class Dancing{
   public static void main(String args []){
        try{
            FileInputStream fstream = new FileInputStream("Blarge.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));

            FileWriter ostream = new FileWriter("danceOut.txt");
            BufferedWriter out = new BufferedWriter(ostream);

            String str = br.readLine();
            int num = Integer.parseInt(str.replaceAll("\\s",""));

            String [] cases = new String[num];
            String temp;
            int k = 0;

            while((temp = br.readLine()) != null && k < num){
                cases[k] = temp;
                ++k;
            }

            for(int i=1; i<= num; i++){
                String scores = cases[i-1].trim();
                int n = calcScores(scores);
     
                out.write("Case #" + i + ": " + n);
                out.write("\n");
                out.flush();
            }
            out.close();
        }
        catch(Exception e){}
   }
   public static int calcScores(String input){
       String [] nums = input.split(" ");
       int N = Integer.parseInt(nums[0].replaceAll("\\s",""));
       int s = Integer.parseInt(nums[1].replaceAll("\\s",""));
       int p = Integer.parseInt(nums[2].replaceAll("\\s",""));

       int scores[] = new int[N];
       int max = 0;
       int sLeft = s;

       for (int i=0; i< N; i++)
           scores[i] = Integer.parseInt(nums[3+i].replaceAll("\\s",""));

       for(int i=0; i < N; i++){
           int x = scores[i];
           if(findMax(x) >= p)
               ++max;
           else{
               if(sLeft > 0 && findSurprise(x) >= p){
                   ++max;
                   --sLeft;                          
               }
           }
       }
       return max;
   }

   // Three cases: mod 1, mod 2 or mod 0
   public static int findMax(int x){
       if(x % 3 == 0)
           return x/3;
       else
           return (x/3) + 1;
   }

   public static int findSurprise(int x){
       if(x % 3 == 2)
           return (x/3) + 2;
       else if(x != 0)
           return (x/3) + 1;
       else
           return 0;
   }
}
