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.FileNotFoundException;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.Collections;
import java.util.Scanner;
import java.util.Vector;


public class pbB {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner sc = new Scanner(new FileReader("test.in"));
		PrintWriter out= new PrintWriter("bigout.out");
		
		int k=sc.nextInt(), n,s,p,rep,sup,inf; Vector<Integer> scores;		
		for(int i=1;i<=k;i++){
			scores= new Vector<Integer>(); 
			n= sc.nextInt();s=sc.nextInt();p=sc.nextInt();
             for(int h= 0;h<n;h++) scores.add(sc.nextInt());
             Collections.sort(scores);
             rep=0; sup= p<1? p: 2*(p-1)+p; inf = p<2 ? p: 2*(p-2)+p;
             for(int h=scores.size()-1;h>=0;h--){
            	 if(scores.elementAt(h)>=sup) rep++;
            	 else if (scores.elementAt(h)>=inf && s>0){
            	    rep++;s--;
            	 }
            	 else break;
             }
		   out.print("Case #"+i+": "+rep);
		   if (i!=k) out.println();
		}
	out.close();
}
}
