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.code.jam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;


public class B {
	public static int Case,N,S,p;
	public static int[] Ti = new int[102];
	
//	public static final String inputfileName = "B-small.in";
//	public static final String outputfileName = "B-small.out";
//	public static final String inputfileName = "B-small-attempt6.in";
//	public static final String outputfileName = "B-small-attempt6.out";
	public static final String inputfileName = "B-large.in";
	public static final String outputfileName = "B-large.out";

	
	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		Scanner s = null;
		PrintWriter outputStream = null;
		
		try{
			s = new Scanner(new BufferedReader(
					new FileReader(inputfileName)));
			outputStream = new PrintWriter(
    				new BufferedWriter(new FileWriter(outputfileName)));
			Case = s.nextInt(); 
			for(int i=0;i<Case;i++){
				N=s.nextInt(); S=s.nextInt(); p=s.nextInt();
				for(int j=0;j<N;j++){
					Ti[j] = s.nextInt();
				}
				int rst = solve();
				System.out.format("Case #%d: %d\n" , i+1, rst);
				outputStream.format("Case #%d: %d\n" , i+1,rst);
			}		
		}finally{
			if (s != null) {
                s.close();
            }
            if (outputStream != null) {
            	outputStream.close();
            }
			
		}
		
	}
    private static int solve() {
    	// TODO Auto-generated method stub
    	int cntS,rst;
    	cntS=0; rst=0;
    	for(int i=0;i<N;i++){
    		int tmp = Ti[i]/3;
    		if(tmp==0){
    			if(Ti[i]>=p){
    				if(p==2){
    					cntS++;rst++;
    				}
    				else if(p<2){
    					rst++;
    				}
    			}
    			continue;
    		}
    		if(Ti[i]==5){
    			if(p<=2){
    				rst++;
    			}
    			else if(p==3){
    				rst++;cntS++;
    			}
    			continue;
    		}
    		if(Ti[i]==4){
    			if(p<=2){
    				rst++;
    			}
    			continue;
    		}
    		if(Ti[i]==3){
    			if(p<=1){
    				rst++;
    			}
    			else if(p==2){
    				rst++;cntS++;
    			}
    			continue;
    		}
    		if(Ti[i]%tmp==0){
    			if(tmp>=p){
    				rst++;
    			}
    			else if(tmp+1==p){
    				rst++;cntS++;
    			}
    		}
    		else if(Ti[i]%tmp==1){
    			if(tmp+1>=p){
    				rst++;
    			}
    		}else{
    			
    			if(tmp+1>=p){
    				rst++;
    			}
    			else if(tmp+2>=p){
    				rst++;cntS++;
    			}
    		}
    	}
    	//System.out.println(N);
    	if(cntS-S>0){    		
    		rst -= cntS-S;
    	}
    	return rst;
    }
}
