import java.util.*;
public class Test {
  public static void main(String[] args){
    Scanner in = new Scanner(System.in);
    int T = in.nextInt();

    for(int i = 1; i<=T; i++) {
      int n = in.nextInt();
      int s = in.nextInt();
      int p = in.nextInt();
      int result = 0;
      for(int j = 0; j<n; j++){
        int x = canAddUp(in.nextInt(), p);
        if(x == 0) {
          result++;
        } else if (x==1 && s > 0) {
          result++;
          s--;
        }
      }
      System.out.println("Case #"+i+": "+result);
    }
  }

  public static int canAddUp(int sum, int limit) {
    boolean flag = false;
    for(int i = 0; i<=sum; i++) {
      for(int j = 0; i+j <= sum; j++) {
        int k = sum-(i+j);
        int a = Math.abs(i-j);
        int b = Math.abs(i-k);
        int c = Math.abs(j-k);
        if(a > 2 || b > 2 || c> 2){
          continue;
        }

        if (i>=limit || j>=limit || k>=limit) {
          if(a < 2 && b < 2 && c < 2) {
            return 0;
          }else{
            flag = true;
          }
        }
      }
    }
    return (flag) ? 1 : 2;
  }
}


import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class ProblemB {
 public static void main(String[] args) throws Exception {
  BufferedReader br = new BufferedReader(new FileReader(new File("B-large.in")));
  PrintWriter pw = new PrintWriter(new File("B-large.out"));
  int n, s,p, count,   temp;
  int t= new Integer(br.readLine());
  for(int c=1; c<=t; c++)
  {
   pw.append("Case #"+c+": ");
   StringTokenizer st = new StringTokenizer(br.readLine());
   n = new Integer(st.nextToken());
   s= new Integer(st.nextToken());
   p = new Integer(st.nextToken());
   count=0;
   if(p==0)
	   count=n;
   else
	for(int i=0; i< n ; i++)
   {
	temp= new Integer(st.nextToken());
	if(temp< p )
		continue;
	
    temp = (temp-p)/2;
    
    if(temp >=p-1)
    	count++;
    else if (temp>=p-2 && s>0 && p>1)
    	{
    		count++;
    		s--;
    	}
   }
   pw.append(count+"");
   pw.append('\n');
  }
  pw.flush();
  pw.close();
  br.close();
 }
}
