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.FileInputStream;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Scanner;

public class Googlers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner scanner = null;
		int caseNumber = 0;
		Googlers a = new Googlers();

		try {
			scanner = new Scanner(new FileInputStream(args[0]));
			while (scanner.hasNextLine()) {

				if (caseNumber == 0) {
					scanner.nextLine();
				} else {
					String pairs = scanner.nextLine();
					String[] numbers = pairs.split(" ");

					System.out.println("Case #" + caseNumber + ": "
							+ a.resolve(numbers));
				}
				caseNumber++;
			}

		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} finally {
			scanner.close();
		}

	}

	private Integer resolve(String[] data) {

		int googlersNumber = Integer.parseInt(data[0]);
		int surprices = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int total = 0;

		ArrayList<Integer> googlers = new ArrayList<Integer>();
		for (int i = 0; i < googlersNumber; i++) {
			googlers.add(Integer.parseInt(data[3 + i]));
		}

		// create the triadas

		ArrayList<Integer[]> scores = createTriada(googlers);

		if (surprices > 0) {
			// Count number surpricing
			Integer totalSuprising = countNumberSurprising(scores);

			if (totalSuprising == surprices) {
				// Count p
				total = countP(p, scores);

			} else {
				// Create missing surprises
				scores = createMissingSurprices(surprices - totalSuprising, p,
						scores, false);

				Integer totalSuprisingB = countNumberSurprising(scores);

				if (totalSuprisingB != surprices) {
					scores = createMissingSurprices(surprices - totalSuprising,
							p, scores, true);
				}

				// check p
				total = countP(p, scores);
			}
		} else {
			total = countP(p, scores);
		}

		return total;
	}

	private ArrayList<Integer[]> createTriada(ArrayList<Integer> g) {

		ArrayList<Integer[]> scores = new ArrayList<Integer[]>();

		for (Integer number : g) {
			Integer[] score = new Integer[3];

			for (int i = 3; i > 0; i--) {

				float resultPrecise = number / i;
				int resultInteger = number / i;
				int calification = 0;
				if (resultPrecise > resultInteger) {
					calification = resultInteger + 1;
				} else {
					calification = resultInteger;
				}
				score[i - 1] = calification;
				number = number - calification;
			}
		
			scores.add(score);
		}

		return scores;
	}

	private Boolean checkSurprising(Integer[] scores) {

		Boolean found = false;

		int a = scores[0] - scores[1];
		int b = scores[0] - scores[2];
		int c = scores[1] - scores[2];

		if (a == 2 || b == 2 || c == 2) {
			found = true;
		}

		return found;
	}

	private int countNumberSurprising(ArrayList<Integer[]> c) {

		Boolean found = false;
		int surpriseN = 0;

		for (Integer[] integers : c) {

			if (checkSurprising(integers)) {
				surpriseN++;
			}
		}

		return surpriseN;

	}

	private ArrayList<Integer[]> createMissingSurprices(int missing, int p,
			ArrayList<Integer[]> s, Boolean forced) {

		for (int i = 0; i < s.size(); i++) {

			if (missing > 0) {

				if (!checkP(p, s.get(i)) || forced) {

					if (s.get(i)[1] > 0) {

						if ((s.get(i)[0] < p && s.get(i)[0] + 1 >= p) || forced) {
							
							Integer[] newTripleta = (Integer[])s.get(i).clone();
							newTripleta[0] = newTripleta[0]+1;
							newTripleta[1] = newTripleta[1]-1;

							if (validTripleta(newTripleta)) {
								s.set(i, newTripleta);
								missing--;
							}
						}
					}

				}
			}
		}
		return s;
	}

	private Boolean validTripleta(Integer[] scores) {
		Boolean found = true;

		int a = scores[0] - scores[1];
		int b = scores[0] - scores[2];
		int c = scores[1] - scores[2];

		if (a > 2 || b > 2 || c > 2) {
			found = false;
		}
		return found;
	}

	private Boolean checkP(int p, Integer[] scores) {

		Boolean found = false;

		for (Integer integer : scores) {
			if (integer >= p) {
				found = true;
				break;
			}
		}

		return found;
	}

	private Integer countP(int p, ArrayList<Integer[]> scores) {

		Integer total = 0;

		for (Integer[] integer : scores) {
			for (Integer integer2 : integer) {
				if (integer2 >= p) {
					total++;
					break;
				}
			}
		}

		return total;
	}

}
