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.FileReader;
import java.io.IOException;
import java.util.ArrayList;


public class Inputter {

	public static ArrayList<Problem> getProblems(String file) throws NumberFormatException, IOException {
		
		BufferedReader in = new BufferedReader(new FileReader(file));
		
		int numOfProblems = Integer.parseInt(in.readLine());
		
		ArrayList<Problem> problems = new ArrayList<Problem>(numOfProblems);
		
		String curLine = in.readLine();
		while (curLine != null) {
			String[] values = curLine.split("[ \t]");
			
			int googlers = Integer.parseInt(values[0]);
			int suprising = Integer.parseInt(values[1]);
			int best = Integer.parseInt(values[2]);
			
			int[] totals = new int[googlers];
			
			for (int i = 3; i < values.length; i++) {
				totals[i - 3] = Integer.parseInt(values[i]);
			}

			problems.add(new Problem(googlers, suprising, best, totals));
			
			curLine = in.readLine();
		}
		
		in.close();
		
		return problems;
	}
}
