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.
 */
package codejam;
import java.util.*;
import java.io.*;
public class DancingWithGooglers {
    public static void main(String[] args) throws Exception
    {
        Scanner input = new Scanner(new File("C:\\temp\\B-large.in"));
        int A = input.nextInt();
        for (int c = 1; c <= A; c++)
        {
        int N = input.nextInt();
        int S = input.nextInt();
        int p = input.nextInt();
        double[] t = new double[N];
        for (int n = 0; n < N; n++)
        {
            t[n] = input.nextInt();
        }
        int a = 0;
        for (int i = 0; i < t.length; i++)
        {
            for (int j = p; j <= 10; j++)
            {
                if (p == 0 && t[i] == 0)
                {
                    a++;
                    break;
                }
                else if (j >= p && j*3-t[i] <= 2 && t[i] > j)
                    {
                        a++;
                        break;
                    }
                    else if (j >= p && j*3-t[i] <=4 && t[i] > j && S>0)
                    {
                        S--;
                        a++;
                        break;
                    }
            }
        }
        System.out.println("Case #" + c + ": " + a);
        }
        
    }
}
