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

public class Dancing_With_Googlers {
	public static void main(String[] args) {
		try {
			// Initialize
			InputStreamReader converter = new InputStreamReader(System.in);
			BufferedReader in = new BufferedReader(converter);
			String curLine = in.readLine();
			String[] googlers;
			
			// Find number of cases
			int N = Integer.parseInt(curLine);
			
			// Read line by line
			for (int line = 0; line < N; line++) {
				curLine = in.readLine();
				googlers = curLine.split(" ");
				int numGooglers = Integer.parseInt(googlers[0]);
				int numSurprising = Integer.parseInt(googlers[1]);
				int p = Integer.parseInt(googlers[2]);
				int curSurprising = 0;
				int maxGooglers = 0;
				
				for (int googler = 3; googler < googlers.length; googler++) {
					if (Integer.parseInt(googlers[googler]) >= 3*p-4
						&& Integer.parseInt(googlers[googler]) <= 3*p-3
						&& Integer.parseInt(googlers[googler]) > 0) {
						curSurprising++;
					}
					else if (Integer.parseInt(googlers[googler]) >= 3*p-2) {
						maxGooglers++;
					}
				}
				maxGooglers += Math.min(curSurprising, numSurprising);
					
				System.out.println("Case #" + (line+1) + ": " + maxGooglers);
			}
		} catch(Exception e) {
			System.out.println("Error: " + e.getMessage());
		}
	}
}
