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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import static java.lang.Math.abs;

public class B {

	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(new FileReader("input.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("output"));

		int T = in.nextInt();

		int n, s, p;
		for (int i = 1; i <= T; i++) {
			// read input
			n = in.nextInt(); s = in.nextInt();	p = in.nextInt();
			int[] googlers = new int[n];
			for (int j = 0; j < n; j++)
				googlers[j] = in.nextInt();

			// solve
			int ans = solve(n, s, p, googlers);
			bw.write("Case #" + i + ": " + ans);
			bw.newLine();
		}
		
		bw.close();
		System.out.println("end");
	}

	private static int solve(int n, int s, int p, int[] googlers) throws IOException {
		boolean[] surp = new boolean[n];
		boolean[] reach = new boolean[n];
		boolean[] both = new boolean[n];
		
		for (int T = 0; T < n; T++)
			for (int i = 0; i <= 10; i++)
				for (int j = i; j <= i+2 && j <= 10; j++)
					for (int k = j; k <= j+2 && j <= 10; k++)
						if (i+j+k == googlers[T] && check(i, j, k))
						{
							boolean a = isSurprising(i, j, k), b = reached(i, j, k, p);
							if(!surp[T]) surp[T] = a && !b;
							if(!reach[T]) reach[T] = b && !a;
							if(!both[T]) both[T] = a && b; 
						}
		
		int max = findMax(n, s, p, surp, reach, both);
		
		return max;
	}

	private static int findMax(int n, int s, int p, boolean[] surp,	boolean[] reach, boolean[] both) {
		
		int max = 0;
		for(int i = 0; i < n; i++)
			if(both[i] || reach[i])max++;
		
		int ss = 0;
		for(int i = 0; i < n; i++)
			if(surp[i] || both[i]) ss++;
		
		if(ss == s)
			return max;
		else // ss > s
		{
			for(int i = 0; i < n; i++)
				if(surp[i] || (both[i] && reach[i])) ss--;
			
			if(ss <= s)
				return max;
			else
				return max-(ss-s);
			
		}
	}

	private static boolean reached(int i, int j, int k, int p) {
		return Math.max(i, Math.max(j, k)) >= p;
	}

	private static boolean isSurprising(int i, int j, int k) {
		return abs(i - j) == 2 || abs(j - k) == 2 || abs(i - k) == 2;
	}

	private static boolean check(int i, int j, int k) {
		return abs(i - j) <= 2 && abs(j - k) <= 2 && abs(i - k) <= 2;
	}
}
