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.util.ArrayList;
import java.util.List;
import java.util.Scanner;

/**
 * Problem B. Dancing With the Googlers
 */

/**
 * @author zdenda
 *
 */
public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);

		int t = in.nextInt();
		in.nextLine();

		for (int i = 1; i <= t; i++) {
			
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			List<Integer> ti = new ArrayList<Integer>();
			for (int j = 0; j < n; j++) {
				ti.add(in.nextInt());
			}
			//in.nextLine();

			int result = compute(s, p, ti);

			System.out.println("Case #"+ i + ": " + result);
			
		}

	}

	/**
	 * computes the maximum number of Googlers that could have had a best result of at least p
	 * 
	 * @param s - the number of surprising triplets of scores
	 * @param p
	 * @param ti - the total points of the Googlers
	 * @return the maximum number of Googlers that could have had a best result of at least p
	 */
	public static int compute(int s, int p, List<Integer> ti) {
		
		// limit for not surprising
		int nsLimit = p + 2 * (Math.max(0, (p-1)));
		// limit for surprising
		int sLimit = p + 2 * (Math.max(0, (p-2)));
		
		// not surprising counter
		int nsCount = 0;
		// surprising counter
		int sCount = 0;
		
		for (Integer score : ti) {
			if(score >= nsLimit) {
				++nsCount; // if it's over not surprising limit
			} else if (score >= sLimit) {
				++sCount; // if it's at over surprising limit, but under not surprising limit 
			}
		}
		
		// max number of surprising scores is S, so we take the smaller number
		sCount = Math.min(s, sCount);
		
		return nsCount + sCount;
		
	}

}
