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

import java.io.*;
import java.util.*;

public class Qual2 {


	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("B-large.in"));
		FileWriter fw = new FileWriter("B-output.txt");
		int total = sc.nextInt();
		for(int i = 1; i <= total; i++) {
			int n = sc.nextInt(), s = sc.nextInt(), p = sc.nextInt();
			int[] scores = new int[n];
			for(int j = 0; j < n; j++) scores[j] = sc.nextInt();
			int count = 0;
			for(int j = 0; j < n; j++) {
				int div = scores[j] / 3, rem = scores[j] % 3;
				if(rem == 0) {
					if(div >= p) count++;
					else if(div == p-1 && div > 0 && s > 0) {
						s--;
						count++;
					}
				}
				else if(rem == 1) {
					if(div + 1 >= p) count++;
				}
				else if(rem == 2) {
					if(div + 1 >= p) count++;
					else if(div + 2 >= p && s > 0) {
						s--;
						count++;
					}
				}
			}
			fw.write("Case #" + i + ": " + count + "\n");
			System.out.println("Case #" + i + ": " + count);
		}
		fw.close();
	}

}
