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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class B {
	static PrintWriter out;

	public static void main(String[] args) throws IOException {
		String name = "B-large";
		Scanner s = new Scanner(new File(name + ".in"));
		int c = s.nextInt();
		out = new PrintWriter(new BufferedWriter(new FileWriter(name + ".out")));
		// out = new PrintWriter(System.out);
		for (int i = 1; i <= c; i++) {
			out.print("Case #" + i + ": ");
			int n = s.nextInt();
			int S = s.nextInt();
			int p = s.nextInt();
			int[] t = new int[n];
			for (int j = 0; j < n; j++) {
				t[j] = s.nextInt();
			}
			int res = solve(n, S, p, t);
			out.print(res);
			out.println();
		}
		out.close();
	}

	static int solve(int n, int s, int p, int[] t) {
		if(p == 0) return n;
		int res = 0;
		for(int i=0; i<n; i++) {
			int b = t[i] / 3;
			int min1=0, max1=0, min2=0, max2=2;
			switch(t[i] % 3) {
			case 0:
				min1 = b;
				max1 = b;
				min2 = b-1;
				max2 = b+1;
				break;
			case 1:
				min1 = b;
				max1 = b+1;
				min2 = b-1;
				max2 = b+1;
				break;
			case 2:
				min1 = b;
				max1 = b+1;
				min2 = b;
				max2 = b+2;
				break;
			}
			if(min2<0) {
				if(max1>=p) {
					res++;
				}
				continue;
			}
			if(max1>=p) {
				res++;
				continue;
			}
			if(max2>=p && s>0) {
				res++;
				s--;
			}
		}
		return res;
	}

}
