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.io.*;
import java.util.*;


public class B {
	
	public static void main(String args[]) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("B-small-attempt0.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		int T = Integer.parseInt(in.readLine());
		for(int i=0; i<T; i++) {
			String s = in.readLine();
			String[] ss = s.split(" ");
			int N = Integer.parseInt(ss[0]);
			int S = Integer.parseInt(ss[1]);
			int P = Integer.parseInt(ss[2]);
			int[] ar = new int[50];
			for(int j=0; j<N; j++) {
				int x = Integer.parseInt(ss[3+j]);
				ar[x]++;
			}
			
			int ans = 0;
			
			if(P==0) ans=N; else {
				int a = 0;
				int b = 0;
				for(int k=40; k>=0; k--) {
					int n = ar[k];
					if(k>(P-1)*3) {
						a+=n;
					} else if(P>1&& (k==(P-1)*3||k==(P-1)*3-1)) {
						b+=n;
					}
				}
				ans = a+Math.min(b,S);
				
			}
			
			out.println("Case #"+(i+1)+": "+ans);
		}
		out.close();
	}
}
