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

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class DancingGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException{
		Scanner scan = new Scanner(new File("B-large.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("B-large.out"));
		
		int testCases = scan.nextInt();
		Map<Double, Integer> mapa = new HashMap<Double, Integer>();
		mapa.put(3d,2);
		mapa.put(6d,3);
		mapa.put(9d,4);
		mapa.put(12d,5);
		mapa.put(15d,6);
		mapa.put(18d,7);
		mapa.put(21d,8);
		mapa.put(24d,9);
		mapa.put(27d,10);
		
		for(int i=0; i < testCases; i++){
			int googlers = scan.nextInt();
			int s = scan.nextInt();
			int p = scan.nextInt();
			int bestResults = 0;
			
			for(int j=0; j < googlers; j++){
				double qual = scan.nextInt();
				
				double firstSecond = Math.round(qual/3d);
				double third = qual-(firstSecond*2);
				
				if(firstSecond >= p || third >= p) {
					bestResults++;
				} else if(s > 0 && p-third <= 2 && third <= firstSecond && !(((third+2)-(firstSecond-1)) > 2) && (third+2) <= 10) {
					bestResults++;
					s--;
				} else if(third == firstSecond && mapa.get(qual) != null && mapa.get(qual) >= p && s > 0){
					bestResults++;
					s--;
				} 
			}
			
			bw.write("Case #"+(i+1)+": "+bestResults+"\n");
		}
		bw.flush();
		bw.close();
	}

}
