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

}

/*
choochootrain
Google Code Jam 2012
*/
import java.io.*;
import java.util.*;

class ProblemB
{
  public static void main (String [] args) throws IOException 
  {
    String filename = "B-small-attempt0";  
    BufferedReader f = new BufferedReader(new FileReader(filename + ".in"));
    PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(filename + ".out")));
    int numberOfTests = Integer.parseInt(f.readLine());
    for(int n = 1; n <= numberOfTests; n++)
    {
      StringTokenizer st = new StringTokenizer(f.readLine());
      int numPeople = Integer.parseInt(st.nextToken());
      int numSurprising = Integer.parseInt(st.nextToken());
      int threshold = Integer.parseInt(st.nextToken());
      ArrayList<Integer> points = new ArrayList<Integer>(numPeople);
      for(int i = 0; i < numPeople; i++) {
        points.add(Integer.parseInt(st.nextToken()));
      }

      int num = 0;
      for(int i = 0; i < points.size(); i++) {
        if(max(makeNormal(points.get(i))) >= threshold) {
          num++;
          points.remove(i);
          i--;
        }
      }

      for(int i = 0; i < points.size() && numSurprising > 0; i++) {
        if(max(makeSurprising(points.get(i))) >= threshold) {
          num++;
          numSurprising--;
          points.remove(i);
          i--;
        }
      }
      String solution = "" + num;
      out.println("Case #" + n + ": " + solution);
    }
    out.close();
    System.exit(0);
  }

  private static int max(int[] nums) {
    if (Math.min(Math.min(nums[0], nums[1]), nums[2]) >= 0)
      return Math.max(Math.max(nums[0], nums[1]), nums[2]);
    else
      return -1;
  }

  private static int[] make (int a, int b, int c) {
    int[] arr = new int[3];
    arr[0] = a;
    arr[1] = b;
    arr[2] = c;
    return arr;
  }

  private static int[] makeNormal(int total) {
    if (total % 3 == 0)
      return make(total/3, total/3, total/3);
    else if (total % 3 == 1)
      return make(total/3, total/3, total/3 + 1);
    else
      return make(total/3, total/3 + 1, total/3 + 1);
  }
  
  private static int[] makeSurprising(int total) {
    if (total % 3 == 0)
      return make(total/3 - 1, total/3, total/3 + 1);
    else if (total % 3 == 1)
      return make(total/3 - 1, total/3 + 1, total/3 + 1);
    else
      return make(total/3, total/3, total/3 + 2);
  }
}
