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


public class Main {
	public static void main(String[] args) throws IOException {
		Scanner scan = new Scanner(new File("input"));
		PrintWriter out =  new PrintWriter(new BufferedWriter
				   (new FileWriter("output")));
		int T = scan.nextInt();
		int compteur =1;
		while(T-->0){
			int N = scan.nextInt();
			int S = scan.nextInt();
			int p = scan.nextInt();
			int max = 0;
			while(N-->0){
				int u = scan.nextInt();
				int quo = u/3;
				int mod = u%3;
				switch(mod){
					case 0:{
						if (quo>=p){
							max++;
						}
						else if(quo+1>=p&&S>0&&quo-1>=0){
							max++;
							S--;
						}
						break;
					}
					case 1:{
						if (quo+1>=p){
							max++;
						}
						break;
					}
					case 2:{
						if (quo+1>=p){
							max++;
						}
						else if(quo+2>=p&&S>0){
							max++;
							S--;
						}
						break;
					}
				}
				
			}
			out.println("Case #"+compteur+": "+max);
			compteur++;
		}
		out.close();
	}

}
