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.google.codejam;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class GoogleDance2 {

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(new BufferedReader(new FileReader("/Users/sunny/Desktop/B-small-attempt0.in")));
		PrintWriter out=new PrintWriter(new FileWriter("/Users/sunny/Desktop/B-small.out"));
		int t = in.nextInt(); int n, s, p ; String line;   
		for( int i = 1 ; i <= t ; i++){
			n = in.nextInt() ; s = in.nextInt() ; p = in.nextInt() ;
			int []scores = new int[n];
			for(int j = 0 ; j < n ; j++) {
				scores[j] = in.nextInt() ; 
			}
			line = "Case #"+i+": "+findMax(n, s, p, scores);
			System.out.println(line);
			out.println(line);
		}
		out.close() ;
	}

	private static int findMax(int n, int s, int p, int[] scores) {
		int d ;
		List<Combination> c= new ArrayList<Combination>();
		boolean gp = true, surp = true; 
		for(int i = 0 ; i < n ; i++) {
			d = scores[i]/3 ; 
			switch (scores[i]%3) {
			case 0 : 
				if(d>=p) {
					c.add(new Combination(gp, !surp));
				}
				else if (d+1 >=p && d-1>=0){
					c.add(new Combination(gp, surp));
				}
				else {
					c.add(new Combination(!gp,!surp));
				}
				break ; 
			case 1 :
				c.add(new Combination(d+1>=p, !surp));
				break ; 
			case 2 :
				if(d+1 >=p) {
					c.add(new Combination(gp, !surp));
				}
				else if (d+2 >=p) {
					c.add(new Combination(gp, surp));
				}
				else {
					c.add(new Combination(!gp, !surp));
				}
				break ;
			}
		}
		
		return colAlgo(c, n, s);
	}

	private static int colAlgo(List<Combination> cs, int n, int s) {
		int count = 0 ; 
		Combination c ; 
		for(int i = 0 ; i < n ; i++) {
			c = cs.get(i);
			if(c.gp){
				if(c.sur) {
					if(s>0){
						s--;
						count++ ;						
					}
				}
				else{
					count++ ; 
				} 
			}
		}
		return count;
	}

	private static class Combination {
		public Combination(boolean gp, boolean surp) { 
			this.gp = gp ; 
			this.sur = surp ;			
		}
		boolean sur ; 
		boolean gp ; 
	}
}
