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.*;
import java.util.StringTokenizer;
import java.lang.Math;

public class qualifycodejamB{

	public static int surprisePVal(int score){
		if(score < 4){
			if(score == 0){
				return 0;
			}else if(score == 1){
				return 1;
			}else{
				return 2;
			}
		}

		double dscore = (double) score;

		if((dscore % 3) == 1){
			return (int)Math.ceil(dscore/3);
		}
		else{
			return ((int)Math.ceil(dscore/3) + 1);
		}

	}

	public static int bestVal(int score){
		if(score < 4){
			if(score == 0){
				return 0;
			}else{
				return 1;
			}
		}
		double dscore = (double)score;
		return (int)Math.ceil(dscore/3);
	}

	public static int process_score(int cscore, int ttl_surp, int surp, int pval){
		int returnval = 0;
		int currentp = bestVal(cscore);


		if(currentp >= pval){
			return 1;
		}

		int bestp = surprisePVal(cscore);

		if (bestp >= pval && ttl_surp > surp){
			return 3;
		}

		return returnval;
	}

	public static void main(String[] args){

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		   String x = null;
		   String linein = null;
		   int totalcases = 0;
		   int ttl_scores = 0;
		   int ttl_surprises = 0;
		   int surprise_count = 0;
		   int pval = 0;
		   int pcount = 0;
		   int currentscore = 0;
		   int scorecount = 0;
		   int counter = 1;
		   int process_return = 0;

		   try{
		    x = br.readLine();
		    totalcases = Integer.parseInt(x);

		    while( (linein = br.readLine()) != null){
					surprise_count = 0;
					pcount = 0;
					scorecount = 0;

					StringTokenizer st = new StringTokenizer(linein);
					ttl_scores = Integer.parseInt(st.nextToken());
					ttl_surprises = Integer.parseInt(st.nextToken());
					pval = Integer.parseInt(st.nextToken());

					while(scorecount < ttl_scores){
						currentscore = Integer.parseInt(st.nextToken());
						process_return = process_score(currentscore,ttl_surprises,surprise_count,pval);
						if ((process_return & 1) == 1){
							pcount++;
						}
						if (process_return == 3){
							surprise_count++;
						}

						scorecount++;
					}

					System.out.print("Case #" + (counter) + ": "+ pcount);
					//System.out.println(" debug: return val: "+process_return+"; used surprises: " + surprise_count + "/"+ttl_surprises);
					System.out.println();

					counter++;
				}

		   }
		   catch (IOException e) {
			   e.printStackTrace();
		   }

	}

}