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 gcj2012.Pre;

import java.util.Scanner;

public class B {

	static Scanner sc = new Scanner(System.in);
	public static void main(String[] a){
				
		long numCases = Long.parseLong(sc.nextLine());
		for(long kase = 0 ; kase < numCases ; kase++){
			String[] ss = sc.nextLine().split(" ");
			int n = Integer.parseInt(ss[0]);
			int s = Integer.parseInt(ss[1]);
			int p = Integer.parseInt(ss[2]);
			int[] scores= new int[n];
			for(int i = 0 ; i < n ; i++)
				scores[i] = Integer.parseInt(ss[3+i]);			
			
			int ret = 0;
			if(p == 0){
				ret = n;
			}else if(p == 1){
				for(Integer i : scores){
					if(i > 0){
						ret++;
					}
				}				
			}else{
				int canCntSurNotNeed = 0;
				int canCntSurNeed = 0;
				int canSurOnly = 0;
				int canCntOnly = 0;
				for(int i = 0 ; i < n ; i++){
					if(scores[i] > 28){
						canCntOnly++;
					}else if(scores[i] >= p+p-1+p-1){
						canCntSurNotNeed++;
					}else if(scores[i] >= p+p-2+p-2){	
						canCntSurNeed++;
					}else if(scores[i] >= 2){
						canSurOnly++;
					}
				}
				if(s <= canCntSurNeed){
					ret = canCntOnly + canCntSurNotNeed + s;
				}else{
					ret = canCntOnly + canCntSurNotNeed + canCntSurNeed;
				}
			}
			
			System.out.println("Case #" + (kase+1) + ": " + ret);
		}
	}
		
}
