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.*;
import java.util.*;
import static java.lang.Math.*;

public class B {
  public static void main(String[] args) throws Exception {
    Scanner sc = new Scanner(new FileReader("B-small-attempt0.in"));
    PrintWriter pw = new PrintWriter(new FileWriter("B-small-output.txt"));
    int T = sc.nextInt();       // number of test cases
    int numResult;
    for (int k=1; k <= T; k++) {
      numResult = 0;
      
      int N = sc.nextInt();     // number of Googlers
      int B = sc.nextInt();     // number of surprising triplet scores
      int p = sc.nextInt();     // "best result" (max of triplets)
      int t[] = new int[N];     // total points for a given Googler (b/t 0 & 30)
      
      int minInd[] = new int[B];
      int minCount = 0;
      
      for (int i=0; i<N; i++) {    // for each of the Googler's total points
        t[i] = sc.nextInt();
      }
      Arrays.sort(t);           // can then start w/ lowest total score
      
      int surpriseCount = 0;    // counts the num of surprising triplets used
      
      for (int i=0; i<N; i++) {    
        // check possible scores:
        if (surpriseCount<B) {
          firstScore: for (int num1=0; num1<11; num1++) {
            for (int num2=min(num1+2,10); num2>=num1; num2--) {
              for (int num3=min(num1+2,10); num3>=num1; num3--) {
                if ((num1+num2+num3)==t[i]) {
                  if (max(num2, num3)>=p) {
                    if (max(num2, num3) > (num1+1)) {
                      surpriseCount++;
                    }
                    numResult++;
                    break firstScore;
                  }
                }
              }
            }
          }
        } else {
          firstScore: for (int num1=0; num1<11; num1++) {
            for (int num2=min(num1+1,10); num2>=num1; num2--) {
              for (int num3=min(num1+1,10); num3>=num1; num3--) {
                if ((num1+num2+num3)==t[i]) {
                  if (max(num2, num3)>=p) {
                    numResult++;
                    break firstScore;
                  }
                }
              }
            }
          }
        }
      }
      
      pw.format("Case #%d: %d\n", k, numResult);
    }
    
    pw.flush();
    pw.close();
    sc.close();
  }
}