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


public class Dancing {

	/**
	 * @param args
	 */
	
	static int t =0;
	//static ArrayList<ArrayList<String>> table = new ArrayList<ArrayList<String>>();	

		public static void inputF() throws FileNotFoundException{
			
			File inputFile = new File("B-large.in");
			Scanner in = new Scanner(inputFile);
			File outputFile = new File("B-large.out");
			PrintWriter out = new PrintWriter(outputFile);
			String result="";
			String input ="";
			
			int n,s,p=0;
			int[] list;
			
			t = in.nextInt();
			//System.out.println(n);
			input = in.nextLine();
			for (int i=1; i<=t; i++) {
				n = in.nextInt();
				s = in.nextInt();
				p = in.nextInt();
				
				list = new int[n];
				for (int j=0; j<n; j++) {
					list[j]=in.nextInt();
				}
				
				//System.out.println("length of the list: "+list.length);
				result = "Case #"+i+ ": "+ count(n,s,p,list);
				out.println(result);
			}
			in.close();
			out.close();
		}
		
	
	
	private static int count(int n, int s, int p, int[] list) {
			int result=0;
			for (int i=0; i<n;i++) {
				int medium = (list[i]-p)/2;
				//System.out.println("("+list[i]+"-"+p+")/2="+medium+" :: "+p);
				
				if ((medium >p-2) & (list[i]>=p)) {
					result++;
				} else if ((medium==p-2) & (s>0)) {
					result++;
					s--;
				}
			}
			return result;
		}



	public static void main(String[] args) throws FileNotFoundException {
		inputF();

	}

}
