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

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class ProblemB {
	public static void main(String[] args) throws FileNotFoundException {
//		Scanner sc = new Scanner(new File("B-practice.in"));
//		Scanner sc = new Scanner(new File("B-small.in"));
		Scanner sc = new Scanner(new File("B-large.in"));
		int cases = sc.nextInt();
		for (int i = 1; i <= cases; i++) {
			// do case things here
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int count = 0;
			for (int j = 0; j < n; j++) {
				int t = sc.nextInt();
				if (p == 0) {
					count++;
					continue;
				}
				if (t == 0) {
					continue;
				}
				if (t == 1) {
					if (p == 1) {
						count++;
					}
					continue;
				}
				if (t == 2) {
					if (p == 1) {
						count++;
					}
					if (p == 2) {
						if (s > 0) {
							s--;
							count++;
						}
					}
					continue;
				}
				if (t/3 >= p) {
					count++;
					continue;
				}
				if (t/3 == p - 1 && t % 3 != 0) {
					count++;
					continue;
				}
				if (s > 0) {
					if (t/3 == p-1) {
						count++;
						s--;
						continue;
					}
					if (t/3 == p-2 && t%3 == 2) {
						count++;
						s--;
						continue;						
					}
				}
			}
			System.out.format("Case #%d: %d\n", i, count);
		}
	}
}
