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;
  }
}

package com.google.code;

import java.io.IOException;

public class B extends GCJ {

	protected B() throws IOException {
		super();
	}

	@Override
	protected void code(int count) throws IOException {
		readLine();
		int N = getIntInput(0);
		int S = getIntInput(1);
		int p = getIntInput(2);
		
		int limitForOrdinary = p + (p - 1 < 0 ? p : p - 1) * 2;
		int result = 0;
		for (int i = 0; i < N; i++) {
			int googler = getIntInput(3 + i);
			if (googler>= limitForOrdinary) {
				result ++;
				continue;
			}
			if (S>0)
				if (googler>1 && googler+2 >=limitForOrdinary) {
					S--;
					result++;
					continue;
				}			
		}
		writeln(result);
	}
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		new B().run();
}
}
