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.util.*;
import java.io.*;
public class Sol2 {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("B-large.in"));
		System.setOut(new PrintStream(new File("B-large.out")));
		int len = sc.nextInt();
		for (int i = 0; i < len; i++) {
			int nexlen = sc.nextInt();
			int surp = sc.nextInt();
			int minscore = sc.nextInt();
			int numb = 0;
			for (int a = 0; a < nexlen; a++) {
				int[] three = separate(sc.nextInt());
				if (isGood(three, minscore)) {
					numb++;
				} else {
					if (((three[0]==three[1]&&three[1]==three[2]&&three[0]!=0)||(three[0]==three[1]&&three[1]-1==three[2]))&&surp>0) {
						if (three[0]+1>=minscore) {
							numb++;
							surp--;
						}
					}
				}
			}
			System.out.println("Case #"+(i+1)+": "+numb);
		}
	}
	public static int[] separate(int i) {
		int[] ret = new int[3];
		ret[0] = (int)Math.ceil(i/3.);
		ret[1] = (int)Math.ceil((i-ret[0])/2.);
		ret[2] = i-ret[0]-ret[1];
		return ret;
	}
	public static boolean isGood(int[] in,int a) {
		for (int i = 0; i < 3; i++) {
			if (in[i]>=a) {
				return true;
			}
		}
		return false;
	}
}