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.*;

public class Dancing{
	
	public static void main(String args[]){
		
		try{
			
			FileInputStream fstream = new FileInputStream(args[0]);
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			
			PrintWriter out = new PrintWriter(args[0] + "_out");
			
			String strLine = br.readLine();
			int cases = Integer.parseInt(strLine);
				
			for (int i = 0; i < cases; i++){
				
				strLine = br.readLine();
				String[] this_literals = strLine.split(" ");
				int[] this_line = new int[this_literals.length];
				for (int j = 0; j < this_literals.length; j++) this_line[j] = Integer.parseInt(this_literals[j]);
				
				int number_of_googlers = this_line[0];
				int number_of_surprises = this_line[1];
				int best_result = this_line[2];
				
				int candidates = 0;
				
				for (int googler = 0; googler < number_of_googlers; googler++){
					
					int unsurprising = 0;
					int surprising = 0;
					
					for (int score1 = 0; score1 <= 10; score1++){
						for (int score2 = 0; score2 <= 10; score2++){
							for (int score3 = 0; score3 <= 10; score3++){
								
								if (score1 + score2 + score3 == this_line[googler+3] &&
									score1 - score2 < 2 && score1 - score2 > -2 &&
									score2 - score3 < 2 && score2 - score3 > -2 &&
									score1 - score3 < 2 && score1 - score3 > -2){ 
									System.out.println("case " + i + " googler " + googler + " score1 " + score1 + " score2 " + score2 + " score3 " + score3);
									if (Math.max(score1,Math.max(score2,score3)) >= best_result) unsurprising++;
									}
									
								if (score1 + score2 + score3 == this_line[googler+3] &&(
									((score1 - score2 == 2 | score1 - score2 == -2) &&
									score2 - score3 < 2 && score2 - score3 > -2 &&
									score1 - score3 < 2 && score1 - score3 > -2)
									|
									(score1 - score2 < 2 && score1 - score2 > -2 &&
									(score2 - score3 == 2 | score2 - score3 == -2) &&
									score1 - score3 < 2 && score1 - score3 > -2)
									|
									(score1 - score2 < 2 && score1 - score2 > -2 &&
									score2 - score3 < 2 && score2 - score3 > -2&&
									(score1 - score3 == 2 | score1 - score3 == -2)))
									
									|
									
									(
									((score1 - score2 == 2 | score1 - score2 == -2) &&
									(score2 - score3 == 2 | score2 - score3 == -2) &&
									score1 - score3 < 2 && score1 - score3 > -2)
									|
									(score1 - score2 < 2 && score1 - score2 > -2 &&
									(score2 - score3 == 2 | score2 - score3 == -2) &&
									(score1 - score3 == 2 | score1 - score3 == -2))
									|
									((score1 - score2 == 2 | score1 - score2 == -2) &&
									score2 - score3 < 2 && score2 - score3 > -2&&
									(score1 - score3 == 2 | score1 - score3 == -2)))){ 
									System.out.println("case " + i + " googler " + googler + " score1 " + score1 + " score2 " + score2 + " score3 " + score3 + "(*)");
									if (Math.max(score1,Math.max(score2,score3)) >= best_result) surprising++;
									}
									
								
							}
						}
					}
					
					if (unsurprising > 0) candidates++;
					else if (surprising > 0 && number_of_surprises > 0){
						candidates++;
						number_of_surprises--;
					}
					
				}
				
				out.println("Case #" + (i+1) + ": " + candidates);
				
				}
				
			
		
			in.close();
			out.close();
			
		}
		
		catch (Exception e){
			System.err.println("Error: " + e.getMessage());
		}
		
	}
		
}
	
