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

public class DancingWithGooglers {

  public static class Googlers {

    public int T;
    public int surp;
    public boolean surprising;
    public boolean pSurprising;
    public boolean antiSurprising;
    public boolean pAntiSurprising;

    public Googlers(int T, int surp) {
      this.T = T;
      this.surp = surp;
    }

    public void set(int a, int b, int c) {
      if (c >= 0 && (a + b + c) == T) {
        int diff = (Math.max(a, Math.max(b, c)) - Math.min(a, Math.min(b, c)));
        if (diff <= 2) {
          if (diff == 2) {
            if (a >= surp || b >= surp || c >= surp) {
              pSurprising = true;
            } else {
              surprising = true;
            }
          } else {
            if (a >= surp || b >= surp || c >= surp) {
              pAntiSurprising = true;
            } else {
              antiSurprising = true;
            }
          }
        }
      }
    }
  }

  public static void main(String... args) throws IOException {
//    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    BufferedReader reader = new BufferedReader(new FileReader("B-large.in"));
//    PrintWriter writer = new PrintWriter(System.out);
    PrintWriter writer = new PrintWriter("B-large.out");

    int len, cases = Integer.parseInt(reader.readLine());
    List<Googlers> satisfied = new ArrayList<Googlers>();
    List<Googlers> unsatisfied = new ArrayList<Googlers>();
    String[] inputs;
    int N, S, p;
    for (int i = 1; i <= cases; i++) {
      inputs = reader.readLine().split(" ");
      p = Integer.parseInt(inputs[1]);
      S = Integer.parseInt(inputs[2]);
      satisfied.clear();
      unsatisfied.clear();
      for (int j = 3; j < inputs.length; j++) {
        int t = Integer.parseInt(inputs[j]);
        Googlers googlers = new Googlers(t, S);

        for (int k = 0; k <= 10; k++) {
          int till = k + 2 > 10 ? 10 : k + 2;
          for (int l = k; l <= till; l++) {
            googlers.set(k, l, (t - (k + l)));
          }
        }
        if (googlers.pAntiSurprising) {
          satisfied.add(googlers);
        } else {
          unsatisfied.add(googlers);
        }
      }
      int pSurprising = 0;
      if (p > 0) {
        for (Iterator<Googlers> iter = unsatisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.pSurprising) {
            pSurprising++;
            iter.remove();
            p--;
            if (p <= 0) break;
          }
        }
      }
      if(p > 0){
        for (Iterator<Googlers> iter = unsatisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.surprising) {
            iter.remove();
            p--;
            if (p <= 0) break;
          }
        }
      }
      if(p > 0){
        for (Iterator<Googlers> iter = satisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.pSurprising) {
            iter.remove();
            pSurprising++;
            p--;
            if (p <= 0) break;
          }
        }
      }
      if(p > 0){
        for (Iterator<Googlers> iter = satisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.surprising) {
            iter.remove();
            p--;
            if (p <= 0) break;
          }
        }
      }

      if(p > 0){
        writer.print("Case #" + i + ": 0");
      }else {
        writer.print("Case #" + i + ": " + (satisfied.size() + pSurprising));
      }
      writer.println();
    }
    writer.flush();
  }


}

import java.util.Scanner;

public class Dance
{
    public static void main(String[] args)
    {
        Scanner jin=new Scanner(System.in);
        int numtries=jin.nextInt();

        jin.nextLine();
        for(int line=0; line<numtries; line++)
        {
            jin.nextInt();

            int surprises=jin.nextInt(), goal=jin.nextInt(), impossible=0;
            //System.out.println(jin.nextLine());
            String[] totals=jin.nextLine().substring(1).split(" ");
            //for(String it : totals) System.out.println(it);

            System.out.print("Case #"+(line+1)+": ");
            for(String each : totals)
            {
                //System.out.println("DEBUG: "+each);
                int total=Integer.parseInt(each), surprising=surprising(total, goal);

                //if(surprising) {surprises--; System.out.println(total+" comes as a surprise");}
                if(surprising!=1) //either tough or impossible
                {
                    if(surprising==0) surprises--; //System.out.println(total+" surprising");}
                    else impossible++; //System.out.println(total+" impossible");} //don't lose allowed surprises for impossibilities
                }
                //else System.out.println(total+" easy");
            }
            if(surprises>=0) System.out.print(totals.length-impossible);
            else System.out.print(totals.length+surprises-impossible);
            System.out.println();
        }
    }

    private static int surprising(int totalPoints, int bestScore)
    {
        if(bestScore>totalPoints) return -1; //impossible ... I can't score that well!

        double remaining=(totalPoints-bestScore)/2.0;

        if(remaining==bestScore) return 1; //unsurprising
        else if(remaining<bestScore) //return bestScore-(int)remaining<=1?1:0; //unsurprising or surprising, round down
        {
            int result=bestScore-(int)remaining;

            if(result<=1) return 1; //unsurprising
            else if(result<=2) return 0; //surprising
            else return -1; //impossible (diff gte 2)
        }
        else /*remaining>bestScore*/ return 1; //unsurprising //(int)(remaining+0.5)-bestScore>1; //round up
    }
}
