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.*;
import java.util.*;
/**
 * Auto Generated Java Class.
 */
public class Problem_b {
  
  
  public static void main(String[] args) { 
    String [] nums=getWords("B-large.in");
    int t=Integer.parseInt(nums[0]);
    for(int i=1;i<nums.length;i++){
      String [] tempstr=nums[i].split(" ");
      int [] temp= new int[tempstr.length];
      for(int x=0;x<tempstr.length;x++){
        temp[x]=Integer.parseInt(tempstr[x]);
      }
      System.out.println("Case #" +i+": "+ check(temp));
    }
  }
  
  public static int check(int [] a){
    int gnum=a[0];
    int surp=a[1];
    int p=a[2];
    int [] scores=new int [gnum];
    for(int i=3;i<a.length;i++){
      scores[i-3]=a[i];
    }
//    for(int x:scores)
//      System.out.print(x+" ");
    //System.out.println(gnum+" "+surp+" "+p);
    int max=0;
    int tempsurps=0;
    for(int i=0;i<scores.length;i++){
      if(scores[i]/3.0 > p-1){
        max++;
      }
      else if(tempsurps<surp && p-scores[i]/3.0 <= 1.5 && scores[i]!=0){
        max++;
        tempsurps++;
      }
    }    
    return max;
  }
  
  public static String [] getWords( String filename ) {
    String [] list = null;
    try {
      Scanner read = new Scanner( new File( filename ) );
      int count = 0;
      while ( read.hasNext() ){
        String temp = read.nextLine();
        count++;
      }
      list = new String[ count ];
      read = new Scanner( new File( filename ) );
      count = 0;
      while ( read.hasNext() ){
        list[count] = read.nextLine();
        count++;
      }
    } catch ( IOException e1 ) {
      System.out.println( "problem reading file" );
    }
    return list;
  }
  /* ADD YOUR CODE HERE */
  
}
