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 com.codejam2012;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Scanner;

public class Problem2 {

	public static void main(String[] args) throws Exception{
		Scanner sc = new Scanner(new FileReader("B-large.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("output1.txt"));
		
		int T = Integer.parseInt(sc.nextLine());
		for (int i=0; i<T; i++){
			
			String tempInput = sc.nextLine();
			String [] range = tempInput.split(" ");
			int N = Integer.parseInt(range[0]);
			int S = Integer.parseInt(range[1]);
			int p = Integer.parseInt(range[2]);
			int rem, quo, pCal, y = 0;
			int [] t = new int[N];
			for(int j=0;j<N;j++){
				t[j] = Integer.parseInt(range[j+3]);
				System.out.println(t[j]);
				quo = t[j] / 3;
				rem = t[j] % 3;
				System.out.println(t[j]+":quo:"+quo+":rem:"+rem);
				if(quo >= p || (quo == p-1 && rem !=0)){
					y++;
					System.out.println(t[j]+"Default True");
				}
				else if (quo < p-2 || (quo == p-2 && rem !=2)){
					System.out.println(t[j]+"Default False");
				}
				else if((quo == p-2 && rem == 2&& quo!=0)||(quo == p-1 && rem == 0&& quo!=0)){
					if(S>0){
						y++;
						S--;
						System.out.println(t[j]+"True");
					}
					else{
						System.out.println(t[j]+"False");
					}
				}
				else if((quo == p-2 && rem == 2&& quo==0 && p==0)||(quo == p-1 && rem == 0&& quo==0 && p==0)){
					y++;
				}
			}
			System.out.println("Case #"+(i+1)+": "+y);
			pw.write("Case #"+(i+1)+": "+y+"\n");
		}
		pw.flush();
		pw.close();
		sc.close();
	}
	
	static boolean checkP(){
		
		
		return true;
	}
	
}


