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.BufferedReader;
import java.io.FileReader;
import java.util.StringTokenizer;

/**
 *
 * @author Sreesasanka G
 */
public class Dancers {
    public static void main(String args[])throws Exception
    {
        BufferedReader in = new BufferedReader(new FileReader("B_Small.in"));
        int cases = Integer.parseInt(in.readLine());
        
        for(int i=0;i<cases;i++)
        {
            StringTokenizer st = new StringTokenizer(in.readLine()," ");
            int n = Integer.parseInt(st.nextToken());
            int s = Integer.parseInt(st.nextToken());
            int p = Integer.parseInt(st.nextToken());
            int[] a = new int[n];
            for(int j=0;j<n;j++)
            {
                a[j] = Integer.parseInt(st.nextToken());
            }
            System.out.println("Case #"+(i+1)+": "+maxPassers(n,s,p,a));
        }
    }
    public static int maxPassers(int n,int s,int p,int a[])
    {
        int count=0,help=0;
        for(int i=0;i<n;i++)
        {
            int quotient = a[i]/3;
            int remainder = a[i]%3;
            if(quotient >= p||((quotient == p-1&& remainder >=2)||(quotient == p-1&& remainder >=1)&&p-1>0))
            {
                count++;
            }
            else if(((quotient == p-1&& remainder >=0)&&p-1>0)||((quotient == p-2&& remainder >=2)&&p-2>=0))
            {
                help++;
            }
        }
        if(help>=s)
        {
            count += s;
        }
        else
        {
            count += help;
        }
        return count;
    }
}