import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

import java.io.BufferedReader;
import java.io.FileReader;
import java.util.StringTokenizer;


public class B {

  void main2(String[] args) throws Exception {
    BufferedReader br = new BufferedReader(new FileReader(args[0]));
    String line = br.readLine();
    int count = Integer.parseInt(line);
    for (int i = 0; i < count; i++) {
      line = br.readLine();

      // 3 1 5 15 13 11
      StringTokenizer st = new StringTokenizer(line, " ", false);
      int n = Integer.parseInt(st.nextToken());
      int s = Integer.parseInt(st.nextToken());
      int p = Integer.parseInt(st.nextToken());

      int[] t = new int[n];
      for (int j = 0; j < n; j++) {
        t[j] = Integer.parseInt(st.nextToken());
      }

      System.out.println("Case #" + (i + 1) + ": " + max(n, s, p, t));
    }
    br.close();
  }


  private int max(int n, int s, int p, int[] t) {
    int max = 0;

    for (int i = 0; i < n; i++) {

      int r = t[i] % 3;
      int k = t[i] / 3;
      int b = 0;
      int bs = 0;
      switch (r) {
      case 0:
        b = k;
        bs = t[i] == 0 ? 0 : k + 1;
        break;
      case 1:
        b = k + 1;
        bs = t[i] == 1 ? -1 : k + 1;
        break;
      case 2:
        b = k + 1;
        bs = k + 2;
      }

      if (b >= p) {
        max++;
      } else if (bs >= p && s > 0) {
        max++;
        s--;
      }

    }
    return max;
  }



  public static void main(String[] args) throws Exception {
    new B().main2(args);
  }
}
