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.FileWriter;
import java.util.Scanner;

public class BSmall {
	public static void get() {
		try {
			File inputFile = new File("B-large.in");
			inputFile.createNewFile();
			Scanner scan = new Scanner(inputFile);
			int t = Integer.parseInt(scan.nextLine());
			File out = new File("out.txt");
			FileWriter fw = new FileWriter(out);
			for (int i = 0; i < t - 1; i++) {
				fw.append("Case #" + (i + 1) + ": ");
				int counter = 0;
				int n = scan.nextInt();
				int s = scan.nextInt();
				int p = scan.nextInt();

				for (int j = 0; j < n; j++) {
					int g1 = scan.nextInt();
					if (g1 == 0 && p > 0) {
						continue;
					}

					if (p > 0) {
						int key = g1 / p;

						if (key >= 3) {
							counter++;
						} else {
							if (key == 2) {
								int talet = p + (g1 % p);
								int v = talet / 2;
								if (p - v == 1) {
									counter++;
								} else {
									if (p - v == 2 && s > 0) {
										counter++;
										s--;
									}
								}
							} else {
								int x = g1 - p;
								x = x / 2;
								if (p - x == 1) {
									counter++;
								} else {
									if (p - x == 2 && s > 0) {
										s--;
										counter++;
									}

								}
							}

						}
					} else {
						counter++;
					}

				}
				fw.append("" + counter + "\n");
			}

			fw.append("Case #" + (t) + ": ");
			int counter = 0;
			int n = scan.nextInt();
			int s = scan.nextInt();
			int p = scan.nextInt();

			for (int j = 0; j < n; j++) {
				int g1 = scan.nextInt();
				if (p > 0) {
					int key = g1 / p;

					if (key >= 3) {
						counter++;
					} else {
						if (key == 2) {
							int talet = p + g1 % p;
							int v = talet / 2;
							if (p - v == 1) {
								counter++;
							} else {
								if (p - v == 2 && s > 0) {
									counter++;
									s--;
								}
							}
						}

					}
				} else {
					counter++;
				}
			}
			fw.append("" + counter);
			fw.close();

		} catch (Exception e) {

		}
	}

	public static void main(String[] args) {
		get();
	}

}
