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.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

public class MainClass {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(new File("B-large.in"));
		PrintWriter out = new PrintWriter(new File("Dancing-large.out"));

		int T = sc.nextInt();
		for (int i = 0; i < T; i++) {
			int ans = 0;

			int N = sc.nextInt(), S = sc.nextInt(), p = sc.nextInt();
			ArrayList<Integer> sums = new ArrayList<Integer>();
			for (int j = 0; j < N; j++) {
				sums.add(sc.nextInt());
			}
			for (int j = 0; j < N; j++) {
				int tempP = p;

				int sum = sums.get(j);
				int sumBackup = sum;
				while (tempP <= 10 && tempP <= sumBackup) {
					sum = sums.get(j);
					sum -= tempP;
					int half = sum / 2;
					int half2 = sum - half;

					if ((Math.abs(half2 - half) <= 1)
							&& (Math.abs(half2 - tempP) <= 1)
							&& (Math.abs(tempP - half) <= 1)) {
						ans++;
						int test = sums.remove(j);
						// System.out.println(test + "\t " + tempP + "\t" + half
						// + "\t" + half2);
						j--;
						N--;
						break;
					}
					tempP++;

				}

			}
			// System.out.println(S);
			outer: for (int j = 0; j < N; j++) {
				int tempP = p;

				int sum = sums.get(j);
				int sumBackup = sum;
				while (tempP <= 10 && tempP <= sumBackup) {
					sum = sums.get(j);
					sum -= tempP;
					int half = sum / 2;
					int half2 = sum - half;
					if ((Math.abs(half2 - half) <= 2)
							&& (Math.abs(half2 - tempP) <= 2)
							&& Math.abs(tempP - half) <= 2) {
						if (S != 0) {

							ans++;
							S--;

							int test = sums.remove(j);
							// System.out.println(test + "\t " + tempP + "\t"
							// + half + "\t" + half2 + "\t" + S);

							j--;
							N--;
							break;
						}
						if (S == 0) {
							// System.out.println("broke");
							break outer;
						}
					}
					tempP++;

				}

			}
			/* System.out.println(sums); */
			out.println("Case #" + (i + 1) + ": " + ans);
		}
		out.close();

	}
}
