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.File;
import java.io.FileNotFoundException;
import java.util.LinkedList;
import java.util.Scanner;


public class dancing {
	
	public static int maxScore(int a){
		if(a==0) return 0;
		return ((a%3)==0)?(a/3)+1:(a%3)+a/3;
	}
	
	public static int maxScoreSanSurprise(int a){
		return (a/3)+Math.min(1, a%3);
	}
	
	public static int solveOne(Scanner scan){
		int n = scan.nextInt();
		int s = scan.nextInt();
		int p = scan.nextInt();
		int nbok =0;
		LinkedList<Integer> possible = new LinkedList<Integer>();
		for(int i=0; i<n; i++){
			int tmp = scan.nextInt();
			if(maxScoreSanSurprise(tmp)>=p){
			//	System.out.println("sans surprise"+tmp);
				nbok++;
			}
			else if(maxScore(tmp)>= p){
				//System.out.println("avec surprise"+tmp);
				possible.add(tmp);
			}
			else{
				//System.out.println("impossible"+tmp+" "+maxScore(tmp)+" "+maxScoreSanSurprise(tmp));
			}
		}
		return nbok+Math.min(s, possible.size());
	}
	
	public static void main(String[] args) throws FileNotFoundException{
		Scanner s = new Scanner(new File("input.txt"));
		int nbcas = s.nextInt();
		for(int i=0; i<nbcas; i++){
			System.out.println("Case #"+(i+1)+": "+solveOne(s));
		}
	}
}
