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();
  }


}

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;


public class DancingGooglers {

    /**
     * @param args
     */
    public static void main(String[] args) {
	// TODO Auto-generated method stub
	try {
	    FileInputStream fstream = new FileInputStream("D:/work/java dev/Google code jam 2012/bin/B-large.in");
	    // Get the object of DataInputStream
	    DataInputStream in = new DataInputStream(fstream);
	    BufferedReader reader = new BufferedReader(new InputStreamReader(in));
	    String numberOfTest = reader.readLine();
	    Integer T = Integer.valueOf(numberOfTest);
	    File resultFile = new File("D:/work/java dev/Google code jam 2012/bin/BRes.txt");
	    FileWriter writer = new FileWriter(resultFile);
	    PrintWriter pWriter = new PrintWriter(writer);
	    for(int j=0;j<T;j++){
		String[] dataset =  reader.readLine().split(" ");
		Integer N = Integer.valueOf(dataset[0]);
		Integer S = Integer.valueOf(dataset[1]);
		Integer p = Integer.valueOf(dataset[2]);
		int numberQualified = 0;
		int surprisingResultFound = 0;
		for(int i=0;i<N;i++){
		    int[] result = getNormalResult(Integer.valueOf(dataset[i+3]));
		    if(isQualified(result,p)){
			numberQualified++;
		    }else if(surprisingResultFound<S){
			if(isPossibleQualifiedSurprisingResult(result, p)){
			    numberQualified++;
			    surprisingResultFound++;
			}
		    }
		}
		pWriter.println("Case #"+(j+1)+": "+numberQualified);
	    }
	    pWriter.flush();
	    pWriter.close();
	} catch (FileNotFoundException e) {
	    // TODO Auto-generated catch block
	    e.printStackTrace();
	} catch (IOException e) {
	    // TODO Auto-generated catch block
	    e.printStackTrace();
	}
    }

    private static int[] getNormalResult(int totalScore) {
	int[] result = new int[3];
	int max = totalScore / 3;
	result[0] = max;
	result[1] = max;
	result[2] = max;
	int i = 0;
	while (totalScore - (result[0] + result[1] + result[2]) > 0) {
	    result[i] += 1;
	    i++;
	}
	return result;
    }
    
    private static boolean isPossibleQualifiedSurprisingResult(int[] result,int bestResult){
	Arrays.sort(result);
	if(result[2]>=bestResult-1){
	    if((bestResult-(result[1]-1)<=2 && result[1]>0)||(bestResult-(result[0]-1)<=2&& result[0]>0)){
		return true;
	    }
	}
	return false;
    }
    
    private static boolean isQualified(int[] result, int qualification){
	boolean boolResult = false;
	for(int i = 0;i<result.length;i++){
	    if(result[0]>=qualification){
		return true;
	    }
	}
	return boolResult;
    }
}
