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 gcj2012.qual;

import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;

public class B {

	final boolean DEBUG = false;
	final String PACKAGE = "gcj2012/qual";
	final String PROBLEM = "B";
	
	boolean noSurprise(int x, int p){
		int y = x-p;
		if(y<0)return false;
		if(1<=p){
			if(y==p-1+p-1)return true;
			if(y==p+p-1)return true;
		}
		if(y==p+p)return true;
		if(p+1<=10){
			if(y==p+p+1)return true;
			if(y==p+1+p+1)return true;
		}
		return false;
	}
	boolean surprise(int x, int p){
		int y = x-p;
		if(y<0)return false;
		if(2<=p){
			if(y==p-2+p)return true;
			if(y==p-2+p-2)return true;
			if(y==p-2+p-1)return true;
		}
		if(p+2<=10){
			if(y==p+2+p)return true;
			if(y==p+2+p+1)return true;
			if(y==p+2+p+2)return true;
		}
		return false;
	}
	
	void run(){
		if(!DEBUG){
			try {
//				System.setIn(new FileInputStream(new File("./src/"+PACKAGE+"/"+PROBLEM+"-small.in")));
				System.setIn(new FileInputStream(new File("./src/"+PACKAGE+"/"+PROBLEM+"-large.in")));
//				System.setOut(new PrintStream(new File("./src/"+PACKAGE+"/"+PROBLEM+"-small_out.txt")));
				System.setOut(new PrintStream(new File("./src/"+PACKAGE+"/"+PROBLEM+"-large_out.txt")));
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
		}
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		boolean[][] nosup = new boolean[31][11], sup = new boolean[31][11], ns = new boolean[31][11], s = new boolean[31][11];
		for(int x=0;x<=30;x++)for(int p=0;p<=10;p++){
			nosup[x][p] = noSurprise(x, p); sup[x][p] = surprise(x, p);
		}
		for(int x=0;x<=30;x++)for(int p=0;p<=10;p++){
			boolean f = false;
			for(int k=p;k<=10;k++)f|=nosup[x][k];
			ns[x][p] = f;
			f = false;
			for(int k=p;k<=10;k++)f|=sup[x][k];
			s[x][p] = f;
		}
		for(int CASE=1;CASE<=T;CASE++){
			int N = sc.nextInt(), S = sc.nextInt(), P = sc.nextInt();
			int[] t = new int[N];
			for(int i=0;i<N;i++)t[i]=sc.nextInt();
			boolean[] proc = new boolean[N];
			for(int i=0;i<N&&0<S;i++)if(!ns[t[i]][P]&&s[t[i]][P]){
				S--; proc[i] = true;
			}
			for(int i=0;i<N&&0<S;i++){
				if(proc[i])continue;
				if(s[t[i]][P]){
					proc[i] = true; S--;
				}
			}
			for(int i=0;i<N&&0<S;i++){
				if(proc[i])continue;
				if(s[t[i]][0]){
					proc[i] = true; S--;
				}
			}
			int res = 0;
			for(int i=0;i<N;i++){
				if(proc[i])res+=s[t[i]][P]?1:0;
				else res+=ns[t[i]][P]?1:0;
			}
			System.out.println("Case #"+CASE+": "+res);
		}
	}
	
	public static void main(String[] args) {
		new B().run();
	}
}
