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();
  }


}

package test;
import java.io.*;

public class Test {
	
	static public void magic(String tmp, int Result [],int index ){
		int N=0,S=0,P=0,size;
		char Carr []= new char[300];
		size=tmp.length();
		tmp.getChars(0, size, Carr, 0);
		
		int i=0,j=0,spc=0;
		String bom;
		while (spc<3){
			
			if(Carr[j]!=' '){
				j++;
			}else{
				bom=tmp.substring(i, j);
				if(spc==0)
					N=Integer.parseInt(bom);
				if(spc==1)
					S=Integer.parseInt(bom);
				if(spc==2)
					P=Integer.parseInt(bom);
				spc++;
				j++;
				i=j;
			}
		}
		
		int counter=N;
		int bomnum,nosur,sur,ans=0;
		nosur=((P-1)*2)+P;
		sur=((P-2)*2)+P;
		if(sur<0)
			sur=1;
		while (counter>0){
			if(Carr[j]!=' '&&j<size){
				j++;
			}else{
				bom=tmp.substring(i, j);
				bomnum=Integer.parseInt(bom);
				if(bomnum>=nosur){
					ans++;
				}else if(bomnum>=sur && S>0){
					ans++;
					S--;
				}
				j++;
				i=j;
				counter--;
			}
		}
		
		Result[index]=ans;
		
	}
	
	public static void main(String[] args) {
		
		////////
		int index=0,T,casenum=1,j;
		String tmp;
		
		int Result[]=new int [101];
		
		////////
		
		BufferedReader reader;
		reader = new BufferedReader(new InputStreamReader(System.in));
		try {
			tmp = reader.readLine();
			T=Integer.parseInt(tmp);
			
			j=T;
			while(j!=0){
				tmp = reader.readLine();
				magic (tmp,Result,index);
				
				index++;
				j--;
			}
			
			j=T;
			while(j!=0){
				System.out.println("Case #"+casenum+": "+Result[casenum-1]);
				casenum++;
				j--;
			}
			
			
		} catch (IOException e) {
			e.printStackTrace();
		}	
	}
}
