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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package CodeJam2012;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author asha.j
 */
public class DancingGooglers {
    
    
    public static void main(String[] args) throws IOException {
        String filename= "B-large";
        Scanner scanner= new Scanner(new File("D:\\codejam\\"+filename+".in"));
        BufferedWriter writer= new BufferedWriter(new FileWriter("D:\\codejam\\"+filename+".out"));
        int numOfCases = scanner.nextInt();
        int noOfGooglers;
        int surpriseScoreCount;
        int p;
        int countAboveP=0;
        ArrayList<Integer> list= new ArrayList<Integer>();
        for(int i=1;i<=numOfCases;i++){
            list.clear();
            countAboveP=0;
            noOfGooglers= scanner.nextInt();
            surpriseScoreCount= scanner.nextInt();
            p= scanner.nextInt();
            for(int m=0;m<noOfGooglers;m++){
                    int data= scanner.nextInt();
                    list.add(data);
            }
            countAboveP= processCase(list, surpriseScoreCount, p);
            writer.write("Case #"+(i)+": "+countAboveP+"\n");
            writer.flush();
        }

    }
    
    private static int processCase(ArrayList<Integer> list,int surprising, int p){
        //System.out.println("processCase:"+list+"  sur:"+surprising+" p:"+p);
        int third;
        int reminder;
        int countAboveP=0;
        for(int score: list){
            third= score/3;
            reminder= score%3;
            if(score==0){
                if(p==0){
                    ++countAboveP;
                }
                continue;
            }
            if(third>=p){
                ++countAboveP;
            }else if(reminder==0){
                if(third+1 >=p && surprising>0){
                    --surprising;
                    ++countAboveP;
                }
            }else if(reminder==1){
                if(third+1 >=p){
                    ++countAboveP;
                }
            }else if(reminder==2){
                if(third+1 >=p){
                    ++countAboveP;
                }else if(third+2 >=p && surprising>0){
                    --surprising;
                    ++countAboveP;
                }
            }
        }
        return countAboveP;
    }
}
