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


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */


import java.io.BufferedOutputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.Scanner;

/**
 *
 * @author violetlily
 */
public class Jam2012Q_B_S {

    private final String ipath = "B-large.in";
    private final String opath = "B-large.ou";

    public void Handle() throws FileNotFoundException {
        
        PrintStream out = new PrintStream(   
                new BufferedOutputStream(   
                        new FileOutputStream(opath)));   
        System.setOut(out);
        
        Scanner sc = new Scanner(new FileInputStream(new File(ipath)));
        int m = sc.nextInt();
        int ii = 1;
        while (m > 0) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int c = 0;
            while(n > 0){
                int t = sc.nextInt();
                if(t%3 == 0){
                    if(t/3 >= p && t/3!= 0){
                        c ++;
                    }else if(t/3 +1 >= p && s > 0 && t/3!= 0){
                        c ++;
                        s--;
                    }else if(t == 0 && t/3 >= p){
                        c ++;
                    }
                }
                else if(t%3 == 1){
                    if(t/3 + 1 >=p ){
                        c++;
                    }
                }else{
                    if(t/3 +1 >= p){
                        c++;
                    }else if(t/3 + 2 >=p && s > 0){
                        c++;
                        s--;
                    }
                }
               n--;
            }
  
            System.out.println("Case #" + ii + ": " + c );
            ii++;
            m--;
        }
        out.close();
    }
    

    public static void main(String args[]) throws Exception {
        Jam2012Q_B_S t = new Jam2012Q_B_S();
        t.Handle();
    }
}
