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

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.Collections;
import java.util.Scanner;
import java.util.ArrayList;

public class DancingWithTheGooglers {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner in = new Scanner(new FileInputStream("input.txt"));
		PrintWriter out = new PrintWriter(new FileOutputStream("output.txt"));
		
		int lines = in.nextInt();
		in.nextLine();
		int counter = 0;
		
		for (;counter<lines;counter++) {
			out.write("Case #" + (counter+1) + ": ");
			
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int finalCount = 0;
			ArrayList<Integer> scores = new ArrayList<Integer>();
			for (int i = 0; i<n; i++) {
				scores.add(in.nextInt());
			}
			Collections.sort(scores);
			for (int i: scores) {
				if (i<p)
					continue;
				else if ((((i-2)/3)+2)<p)
					continue;
				else if ((((i-1)/3)+1)>=p)
					finalCount++;
				else if (s>0) {
					s--;
					finalCount++;
				}
			}
			out.write(finalCount + "\n");
		}
		
		in.close();
		out.close();
	}
}
