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.io.*;
import java.util.ArrayList;
import java.util.StringTokenizer;

public class B implements Runnable {
    private static BufferedReader reader;
    private static StreamTokenizer st;
    private static PrintWriter writer;

    public static void main(String[] args) {
        new Thread(new B()).start();
    }

    @Override
    public void run() {
        try {
            solve();
        } catch (IOException e) {}
    }

    private void solve() throws IOException {
        reader = new BufferedReader(new FileReader("b.in"));
        st = new StreamTokenizer(reader);
        writer = new PrintWriter(new FileWriter("b.out"));

        int n = nextInt();
        for (int i = 1; i <= n; i++) {
            int temp = countAns();
            writer.println("Case #" + i + ": " + temp);
        }

        reader.close();
        writer.close();
    }

    static String nextToken() throws IOException {
        st.nextToken();
        return st.sval;
    }

    static int nextInt() throws NumberFormatException, IOException {
        st.nextToken();
        return (int)st.nval;
    }

    private static int countAns() throws IOException{
        int n = nextInt();
        int s = nextInt();
        int p = nextInt();
        //writer.print(String.valueOf(n) + " " + String.valueOf(s) + " " + String.valueOf(p) + " ");

        ArrayList<Integer> num = new ArrayList<Integer>(n);
        int nonSurprisingNum = 0;
        for (int i = 0; i < n; i++) {
            int temp = nextInt();
            //writer.print(String.valueOf(temp) + " ");
            num.add(temp);
        }

        if (p == 0) return n;

        int nonSurprisingFrame = p + 2 * (p - 1);
        for (int i = 0; i < num.size(); i++) {
            int curNum = num.get(i);
            if (curNum >= nonSurprisingFrame) {
                nonSurprisingNum++;
                num.remove(i);
                i--;
            }
        }
        if (s == 0) return nonSurprisingNum;

        int surprisingFrame = Math.max(0, p + 2 * (p - 2));
        int len = num.size();
        int cnt = 0;
        while (s > 0 && cnt < len) {
            int curNum = num.get(cnt);
            if (curNum > 0 && curNum >= surprisingFrame) {
                s--;
                nonSurprisingNum++;
            }
            cnt++;
        }

        return nonSurprisingNum;
    }

}