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.Scanner;


public class Main {
	public static void main(String [] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int x=0; x<T; x++) {
			int N = in.nextInt(); //googlers
			int S = in.nextInt(); //surprising
			int p = in.nextInt(); //score to beat
			
			int direct = 0;
			int poss = 0;
			
			for(int i=0; i<N; i++) {
				int total = in.nextInt();
				int m = total/3;
				int mod = total %3;
				if(mod >0)
					m++;
				if(m>=p) {
					direct++;
					continue;
				}
				else if(m<p-1)
					continue;
				//Time to use possibilities
				switch(mod) {
				case 0:
					if(m<10 && m>0)
						poss++;
					break;
				case 2:
					if(m<10)
						poss++;
					break;
				}
			}
			int result = (S>poss)? poss : S;
			result += direct;
			System.out.print("Case #" + String.valueOf(x+1) + ": ");
			System.out.println(result);
		}
	}
}