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.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;


public class B {

	/**
	 * @param args
	 */
	
	public static String rest(ArrayList<String> list)
	{
		
		String n = list.get(0);
		list.remove(0);
		return n;
	};
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		String line;
		ArrayList<String> liste = new ArrayList<String>();
		
		
		BufferedReader buffer = null;
		try {
			buffer=new BufferedReader(new FileReader(new File(args[0])));
			
			for(int i=0; (line = buffer.readLine())!=null; i++){
				liste.add(line);
			}
		}
		catch(IOException e){
				System.out.println("IO-Fehler!");
		}	
		
		
		int anzahl = Integer.parseInt(rest(liste));



		// fuer jeden Fall methode aufrufen
		for ( int i = 0 ; i < anzahl; i++  ){
			methode(i+1, liste);
		}
	}

	// spezifische code fr alle aufgaben
	public static void methode(int nummer, ArrayList<String> liste)
	{
		// buffer und input machen
		// input ist ein stringarray mit meiner ersten Zeile
		// String[] input = rest(liste);
		StringBuffer ergebnisbuffer = new StringBuffer(); 
		
		String[] input = rest(liste).split(" ");
		ArrayList<Integer> arraylist = new ArrayList<Integer>();
		
		
		for (int i=0; i < input.length; i++){
			int n = Integer.parseInt(input[i]);
			arraylist.add(n);
		}

		int googler = arraylist.get(0);

		
		int surprises = arraylist.get(1);

		
		int p = arraylist.get(2);

		
		ArrayList<Integer> ergebnisse = new ArrayList<Integer>(5);
		
		arraylist.subList(3, arraylist.size());
		
		for (int i=3; i < arraylist.size() ; i++){
			ergebnisse.add(arraylist.get(i));
		}
		
		int sum = 0;
		int newsurprises = surprises;
		
		
		for (int i=0; i < ergebnisse.size();i++){
			if(ergebnisse.get(i) == 0)
			{
				ergebnisse.remove(i);
			}
		}

		Collections.sort(ergebnisse);
		Collections.reverse(ergebnisse);
		

		
		for (int i=0; i < ergebnisse.size();i++){
			if ((ergebnisse.get(i) >= 0) && (ergebnisse.get(i)<= 30)){
				if(ergebnisse.get(i) >= ((3*p)-2)){
					sum=sum+1;
				}
				if((ergebnisse.get(i) == ((3*p)-4)) && (newsurprises >0)){
					sum=sum+1;
					newsurprises=newsurprises-1;
				}
				if((ergebnisse.get(i) == ((3*p)-3)) && (newsurprises >0)){
					sum=sum+1;
					newsurprises=newsurprises-1;
				}
			}
		}
		
		if (p == 0){
			sum = googler;
		}

		System.out.println("Case #" + nummer + ": " + sum);
	}
}