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 adream;

import java.util.Scanner;

/**
 *
 * @author sarah
 */
public class GoogleDancers {

    public int max(int[] googs , int p , int s){
        int surp = 0;
        int max  = 0;
        if(p == 0)
            return googs.length;
        for(int i = 0 ; i < googs.length ; i++){
            int g1=0,g = googs[i];   
            if(g == 0)continue;
            if(g%3 == 0){
                if(surp < s && g/3 < p && g/3 +1 >= p){
                    g1 = g/3 +1;
                    surp++;
                }else
                    g1 = g/3 ;
            }else{
                if((g+1) % 3 == 0){
                    if(surp < s &&(g+1)/3 <p && (g+1)/3 + 1 >= p){
                        g1 = (g+1)/3 + 1;                   
                        surp++;
                    }else
                        g1 = (g+1)/3;
                }else{
//                     if(surp < s &&(g-1)/3 + 1 < p && (g-1)/3 + 1 >= p){
//                        g1 = (g+1)/3 + 1;                   
//                        surp++;
//                    }else
                        g1 = (g-1)/3 +1;
                }
            }
            if(g1 >= p)
                max++;

        }

        return max;
    }


    public static void main(String args[]){
        GoogleDancers gd = new GoogleDancers();
        Scanner sc = new Scanner(System.in);
        int tc = sc.nextInt();
        int i = 0 ;
        while(i++ < tc){
            int n = sc.nextInt(); // dancers
            int s = sc.nextInt(); //surprising
            int p = sc.nextInt(); //max
            int[] dancers = new int[n];
            for(int j = 0 ; j < n ; j++)
                dancers[j] = sc.nextInt();
            int res = gd.max(dancers,p,s);
            System.out.println("Case #"+i +": "+res);
        }
    }
}
