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;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Scanner;

class ProbB{
	public static void main(String[] args) throws FileNotFoundException{
                
                File in;
                File out;
                Scanner sc;
                PrintWriter pw;
                int T;
		
                in = new File("B2.in");
                out = new File("B.out");
                
                sc = new Scanner(in);
                pw = new PrintWriter(out); 
                
                T = sc.nextInt();
                sc.nextLine();
                
                for(int j = 1; j<=T; j++){
                    int N = sc.nextInt();
                    int S = sc.nextInt();
                    int S2 = S;
                    int p = sc.nextInt();
                    int ans = 0;
                    for(int u = 1; u<=N; u++){
                        int a = sc.nextInt();
                        int e = isEligible(a, p);
                        switch(e){
                            case 2:
                                ans++;
                                break;
                            case 1:
                                S--;
                                ans++;
                                break;
                        }
                       
                    }
                    if(S<0){
                            ans = ans + S;
                        }
                    pw.println("Case #" + j + ": " + ans);
                }
		pw.close();
                
	}
        static int isEligible(int a, int p){
            int lo = a/3;
            int me = (a - lo)/2;
            int hi = a - lo - me;
            
            if(hi>=p){
                return 2;
            }
            if(hi==me && hi+1>=p && me != 0){
                return 1;
            }
            else{
                return 0;
            }
        }
	
}