import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

package CodeJam;

import java.io.*;
import java.util.*;

public class B_2012 {

	public static void main(String[] args) throws IOException {
		

		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("test2.out")));
		
		int NS[] = {0,1,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10};
		int S[] = {-1,-1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10,-1,-1};
		
		int cases= in.nextInt();
		
		for(int c=0;c<cases;c++){
			int n = in.nextInt();
			int s = in.nextInt();
			int b = in.nextInt();	
			int C=0;
			ArrayList<Integer>  G = new ArrayList<Integer>();
					
			for(int i=0;i<n;i++) G.add(in.nextInt());
			Collections.sort(G);
			for(int i=0;i<G.size();i++){
				if(s>0 && S[G.get(i)]>=b) {
					s--;
					G.remove(i);
					C++;
					i--;
				}
			}
			for(int i=0;i<G.size();i++){
				if(s>0 && NS[G.get(i)]<b && S[G.get(i)]<b ) {
					s--;
					G.remove(i);
					i--;
				}
			}
			for(int i=0;i<G.size();i++)
				if(NS[G.get(i)]>=b ) C++;
			
			out.println("Case #"+(c+1)+": "+C);
			
		}
		out.close();
		System.exit(0);
	}
}
