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.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;

/**
 *
 * @author Luis Sergio Curay
 */
public class b_2 {

    public b_2() {
        Scanner in= new Scanner(System.in);
        int t= in.nextInt();
        HashMap<Integer, ArrayList<ArrayList<Integer>>> comb= new HashMap<Integer, ArrayList<ArrayList<Integer>>>();
        for (int i = 0; i <= 30; i++) {
            ArrayList<ArrayList<Integer>> curr= new ArrayList<ArrayList<Integer>>();
            for (int j = 0; j <= 10; j++) 
                for (int k = 0; k <= 10; k++) 
                    for (int l = 0; l <= 10; l++) 
                        if((j+k+l) == i) {
                            ArrayList<Integer> tmp= new ArrayList<Integer>();
                            int arr[]= new int[]{j,k,l};
                            Arrays.sort(arr);
                            for (int m = 0; m < arr.length; m++) {
                                tmp.add(arr[m]);
                            }
                            curr.add(tmp);
                        }
            comb.put(i, curr);
        }
        for (int i = 0; i < t; i++) {
            int n= in.nextInt();
            int s= in.nextInt();
            int p= in.nextInt();
            int res= 0;
            for (int j = 0; j < n; j++) {
                int c= in.nextInt();
                int rank= 0;
                ArrayList<ArrayList<Integer>> curr= comb.get(c);
                for (ArrayList<Integer> combs : curr) {
                    if(combs.get(0).equals(combs.get(1)) && combs.get(0).equals(combs.get(2))) {
                        if(combs.get(0) >= p) {
                            rank=6;break;//res++;break;
                        }
                    } else if(combs.get(0).equals(combs.get(1))) {
                        if(combs.get(2) >= p && (combs.get(2) - combs.get(1)) == 1) {
                            if(rank < 5) rank= 5;//res++;break;
                        } else if(combs.get(2) >= p && (combs.get(2) - combs.get(1)) == 2 && s > 0) {
                            if(rank < 4) rank= 4;//res++;s--;break;
                        }
                    } else if(combs.get(1).equals(combs.get(2))) {
                        if(combs.get(1) >= p && (combs.get(1) - combs.get(0)) == 1) {
                            if(rank < 3) rank= 3;//res++;break;
                        } else if(combs.get(1) >= p && (combs.get(1) - combs.get(0)) == 2 && s > 0) {
                            if(rank < 2) rank= 2;//res++;s--;break;
                        }
                    } else {
                        if(combs.get(2) >= p)
                            if((combs.get(2) - combs.get(1)) == 1 && (combs.get(1) - combs.get(0)) == 1 && s > 0) {
                                if(rank < 1) rank= 1;//res++;s--;break;
                            }
                    }
                }
                if(rank == 6 || rank ==5 || rank == 3)
                    res++;
                else if( rank > 0){
                    res++;s--;
                }
            }
            System.out.println("Case #" + (i + 1) + ": " + res);
        }
    }
    
    public void print(ArrayList<Integer> t) {
        for (Integer integer : t) {
            System.out.print(integer + " ");
        }
        System.out.println();
    }
}