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

// Google Code Jam Qualification Round 2012
// Problem B. Dancing With the Googlers

import java.util.*;
import java.io.*;

public class DancingWithTheGooglers {
    static String inname = "B-large.in";    // input file name here
    static String outname = "B-large.out";  // output file name here
    public static void main(String[] args){
        try{
            Scanner in = new Scanner(new BufferedReader(new FileReader(inname)));
        	//Scanner in = new Scanner(System.in);
            BufferedWriter out = new BufferedWriter(new FileWriter(outname));
            int n, s, p, t[];
            int T = in.nextInt();
            for (int cas = 1; cas <= T; cas++){
            	int ans = 0;
            	n = in.nextInt();
            	s = in.nextInt();
            	p = in.nextInt();
            	t = new int[n];
            	for (int i = 0; i < n; i++)
            		t[i] = in.nextInt();
            	for (int i = 0; i < n; i++){
            		if (t[i]%3 == 0){
            			if (t[i]/3 >= p) ans++;
            			else if (t[i]/3 == p-1 && t[i] > 1 && s > 0){
            				ans++; s--;
            			}
            		} else {
            			if (t[i]/3+1 >= p) ans++;
            			else if (t[i]/3+1 == p-1 && t[i] > 1 && t[i]%3 == 2 && s > 0){
            				ans++; s--;
            			}
            		}
            	}
                //System.out.print("Case #" + cas + ": " + ans + "\n");
                out.write("Case #" + cas + ": " + ans + "\n");
            }
            in.close();
            out.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }
}
