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.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class GooglerIdol {

	/**
	 * @param args
	 */
	public static void main(String[] args) {

		File sample = new File(
				"D:/Feng/Workspace/googlecodejam2012/problemB/in/sample.in");
		
		File in = new File(
				"D:/Feng/Workspace/googlecodejam2012/problemB/in/B-large.in");

		try {
			BufferedWriter out = new BufferedWriter(new FileWriter(
					"D:/Feng/Workspace/googlecodejam2012/problemB/out/outlarge.txt"));
			StringBuilder s;
			String line = "";
			int googlers, surprises, p = 0;
			int[] totalScores;
			int idols, chances = 0;
			int count = 1;
			Scanner scanner = new Scanner(in);
			// Ignore the first line showing total count
			scanner.nextLine();
			while (scanner.hasNextLine()) {
				s = new StringBuilder("Case #");
				s.append(count);
				s.append(": ");
				line = scanner.nextLine();

				String[] tokens = line.split(" ");
				googlers = Integer.parseInt(tokens[0]);
				surprises = Integer.parseInt(tokens[1]);
				p = Integer.parseInt(tokens[2]);
				totalScores = new int[googlers];
				for (int i = 3; i < tokens.length; i++) {
					totalScores[i - 3] = Integer.parseInt(tokens[i]);
				}
				Arrays.sort(totalScores);

				idols = 0;
				chances = surprises;
				for (int j = googlers - 1; j >= 0; j--) {
					if (pass(p, totalScores[j], false)) {
						idols++;
					}
					else if (chances > 0 && pass(p, totalScores[j], true)) {
						idols++;
						chances--;
					}
				}

				s.append(idols);
				/*
				s.append("\ngooglers:");
				s.append(googlers);
				s.append(" surprises:");
				s.append(surprises);
				s.append(" p:");
				s.append(p);
				s.append("\nTotal Scores");
				s.append(Arrays.toString(totalScores));
				*/

				System.out.println(s);
				out.write(s.toString());
				out.newLine();
				count++;
			}
			scanner.close();
			out.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

	public static boolean pass(int p, int totalScore, boolean surprise) {

		if (p == 0)
			return true;
		
		if (totalScore == 0)
			return false;

		int avg = totalScore / 3;
		if (avg >= p)
			return true;
		
		int diff = totalScore - (3 * avg);

		if (p - avg == 1 && diff > 0) {
			return true;
		}
		
		if (surprise && p - avg == 1 && diff == 0) {
			return true;
		}

		if (surprise && p - avg == 2 && diff > 1) {
			return true;
		}

		return false;
	}
}
