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 codejam2012.B;

import java.io.File;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

/**
 *
 * @author Rymbu VV
 */
public class DancingWithGooglers {

    private Scanner sc;
    private PrintWriter pw;
    private int CASES;
    
    public static void main(String[] args) {
        DancingWithGooglers suk = new DancingWithGooglers("c:\\b.in", "c:\\b.out");
        suk.execute();
    }
    
    public DancingWithGooglers(String fileIn, String fileOut) {
        try{
            sc = new Scanner(new File(fileIn));
            pw = new PrintWriter(new FileWriter(fileOut));
            CASES = sc.nextInt();
        }catch(Exception e){System.out.println("In Constructor "+e);}
    }
    
    public void execute(){
        int N, S, p, count;
        for(int ncase = 1; ncase <= CASES; ncase++){
            pw.print("Case #"+ncase+": ");
            
            N = sc.nextInt();
            S = sc.nextInt();
            p = sc.nextInt();
            count = 0;
            for (int i=0; i<N; i++){
                int t = sc.nextInt();
                if (t>=p && (t/3) >= p ){
                    count++;
                    continue;
                }
                int tmp = t-p;
                if (t>=p && (p-(tmp/2)) <= 1){
                    count++;
                    continue;
                }
                if (S>0 && t>=p && (p-(tmp/2)) <= 2){
                    count++;
                    S--;
                }
            }
            
            pw.println(count);
        }
        pw.flush();
        pw.close();
        sc.close();
    }
}
