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

public class B extends CodeJammer {

	public void process() throws IOException {
		int[] input = reader.readArray();
		int n = input[0];
		int s = input[1];
		int p = input[2];
		int auto =0; //scores that reach p automatically
		int poss = 0; //scores that can reach p with surprise
		for (int i=3; i<n+3; i++) {
			int score = input[i];
			int def = (score/3);
			int mod = (score%3);
			if (mod != 0) def++;//ceiling, not floor
			if (def >= p) auto++;
			else if (def == p-1 && def > 0 && mod != 1) poss++;
		}
		if (poss > s) poss = s; //cap number of surprising scores that reach p
		output(auto+poss);
	}

	public static void main(String[] args) {
		B b = new B();
		b.run(args);
	}

}
