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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;

/**
 *
 * @author Student
 */
public class Test2 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException {
        // TODO code application logic here
        int i=1;
        Scanner ss=new Scanner(new File("B-large.in.txt"));
        PrintWriter x=new PrintWriter(new File("B-large.out.txt"));
        if(ss.hasNext()) ss.next();
        while(ss.hasNextLine()&&i<=100){
            int n = 0;
            if(ss.hasNext()) n=Integer.parseInt(ss.next());
            int s = 0;
            if(ss.hasNext()) s=Integer.parseInt(ss.next());
            int p = 0;
            if(ss.hasNext()) p=Integer.parseInt(ss.next());
            LinkedList<Integer> l=new LinkedList<>();
            for(int index=0;index<n;index++) l.add(Integer.parseInt(ss.next()));
            x.println("Case #"+i+": "+Best.opt(n,s,p, l));
            i++;
        }
        x.close();
        }
    }
