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);
		
		
		
	}
}

import java.util.*;

class B{
	public static void main(String... arg){
		Scanner sc = new Scanner(System.in);
		
		int cases = sc.nextInt();
		
		for(int caseNo = 1; caseNo <= cases; caseNo++ ){
			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();
			
			int[] t = new int[N];
			int n = 0;
			for(int i = 0; i < N; i++)
					t[i] = sc.nextInt();
			if(p == 0)
				System.out.println("Case #" + caseNo + ": " + N);
			else{
				for(int i = 0; i < N; i++){
					int tmp = ((int)(t[i]/3));
					if(t[i] == 0) tmp = 0;
					else{
						if(t[i] % 3 != 0) tmp = tmp + 1;
					}
					if(tmp >= p) n++;
				}
				if (S == 0)
					System.out.println("Case #" + caseNo + ": " + n);
				else{
					Arrays.sort(t);
					for(int i = N-n-1; i >= 0 && S > 0; i--){
						int tmp = ((int)(t[i]/3));
						if(t[i] == 0) tmp = 0;
						else{
							int rem = t[i] % 3;
							if(rem == 2 && t[i] <= 28) tmp = tmp + 2;
							else if(rem == 0 && t[i] <= 29) tmp = tmp + 1;
							else continue;
						}
						if(tmp >= p) { n++; S--; }
					}
					System.out.println("Case #" + caseNo + ": " + n);
				}
			}
		}
	}
}