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.evolve.codejam2012.qualification;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Dancing {

	private static final String TEST_FILE = "B-large.in";
	private PrintWriter pw = null;
	private BufferedReader br = null; 		
	
	Dancing(boolean skip) throws IOException {
		
		
		String outFile = TEST_FILE.replace(".in", ".out");
		System.out.println(outFile);
		this.pw = new PrintWriter(new FileWriter(outFile));
		if (skip)
			return;
		
		File file = new File(TEST_FILE);
		if (file.exists()) {
			br = new BufferedReader(new java.io.FileReader(TEST_FILE));
		} else {
			br = new BufferedReader(new InputStreamReader(System.in), 1 << 16);
		}
	}	
	
	void doit() throws NumberFormatException, IOException {
		int testsNumber = Integer.parseInt(br.readLine());
		
		System.out.println(testsNumber);
		
		for (int i = 1; i <= testsNumber; i++) {
			StringTokenizer st = new StringTokenizer(br.readLine());
			StringBuilder sb = new StringBuilder();

			int N = Integer.parseInt( st.nextToken() ); // number of googlers 1 <= N <= 3.
			int S = Integer.parseInt( st.nextToken() ); // number of surprising triplets of scores  0 <= S <= N.
			int p = Integer.parseInt( st.nextToken() ); // minimal result 0 <= p <= 10.
			
			int[] scores = new int[N];
			for (int j = 0; j < N; j++) {
				scores[j] = Integer.parseInt( st.nextToken() ); // 0 <= ti <= 30.
			}
			
			// non surprising
			boolean[] nonsurpising = new boolean[N];
			int counter = 0;
			for (int score : scores) {
				//nonsurpising[counter] = false;
				
				if (score % 3 == 0) {
					int a = score / 3;
					if (a >= p) {
						nonsurpising[counter] = true;
					}
				} 
				if (score >= 1 && (score-1) % 3 == 0)  {
					int a = (score-1) / 3 + 1;
					if (a >= p) {
						nonsurpising[counter] = true;
					}
				} 
				if (score >= 2 && (score-2) % 3 == 0) {
					int a = (score-2) / 3 + 1;
					if (a >= p) {
						nonsurpising[counter] = true;
					}
				}
				counter++;
			}
			
			// surprising
			boolean[] surpising = new boolean[N];
			if (S > 0) {  // tylko gdy sa jakies
				// zakladamy ze kazdy jest surprising
				
				counter = 0;
				for (int score : scores) {
					//surpising[counter] = false;
					
					if (score >= 3 && (score-3) % 3 == 0) {
						int a = (score-3) / 3 + 2;
						if (a >= p) {
							surpising[counter] = true;
						}
					} 
					
					if (score >= 2 && (score-2) % 3 == 0) {
						int a = (score-2) / 3 + 2;
						if (a >= p) {
							surpising[counter] = true;
						}
					} 

					if (score >= 4 && (score-4) % 3 == 0) {
						int a = (score-4) / 3 + 2;
						if (a >= p) {
							surpising[counter] = true;
						}
					} 
					
					counter++;
				}
			}
			
			System.out.println("nonsurprising: " + Arrays.toString(nonsurpising));
			System.out.println("surprising: " + Arrays.toString(surpising));
			
			int max = 0;
			for (int k = 0; k < N; k++) {
				if (nonsurpising[k]) {
					max++;
				} else if (S > 0 && surpising[k]) {
					max++;
					S--;
				}
			}
			
			pw.println("Case #" + i + ": " + max);
		}
		pw.flush();
		pw.close();
	}	
	
	public static void main(String[] args) throws NumberFormatException, IOException {
		new Dancing(false).doit();

	}

}
