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.Scanner;

//"c:\Program Files\Java\jdk1.6.0_25\bin\javac.exe"  a.java
//"c:\Program Files\Java\jdk1.6.0_25\bin\java.exe"  a <test.in >test.out
public class B {

	public static String meth1 (String s){
		String res = "";
		res=res+s;
		
	return res;	  
	}
	//"c:\Program Files\Java\jdk1.6.0_25\bin\javac.exe"  A.java
	//"c:\Program Files\Java\jdk1.6.0_25\bin\java.exe"  A <test.in >test.out
	 static Scanner sc = new Scanner(System.in);
	 public static void main(String[] args) {
	  int cases  ;
	  int res=0;
	   
	 // String [] inputs;
	
	  cases =  Integer.parseInt(sc.nextLine());  
	  int N=0;
	  int S = 0;
	  int P =0;
	  int p = 0;
	  int [] t;
	  for(int id = 1; id <= cases; id++){
		 res=0;
		  N = sc.nextInt();
		  S = sc.nextInt();
		  P = sc.nextInt();
		
		  p = 3*P;
		  t = new int[N];
		  for(int i=0;i<N;i++){
			  t[i] = sc.nextInt();
			  if (t[i]>=P){
				  if (t[i]+2>=p){
					  res++;
				  }
				  else{
					  if (t[i]+4>=p&&S>0){
						  res++;
						  S--;
					  }
				  }
			  }
		  }
		 // for (int i = 0;i<D;i++){}
		  
		  
		  System.out.printf("Case #%d: %d%n", id, res);
	 sc.nextLine();
	  }
	 }
}