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 ab.gcj;

import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Surprising {

    public static void main(String args[])
    {

        Surprising s = new Surprising();
    }

    public Surprising()
    {
        try{
            BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

            int numOfTests = Integer.parseInt(reader.readLine());
            for(int j = 0 ; j < numOfTests ; j++)
            {
            String[] tstr = reader.readLine().split(" ");
            int numGooglers = Integer.parseInt(tstr[0]);
            int surprising = Integer.parseInt(tstr[1]);
            int p = Integer.parseInt(tstr[2]);
            int [] t = new int[numGooglers];
            for(int i =0 ; i < t.length; i++)
            {
                t[i] = Integer.parseInt(tstr[i+3]);
            }

            System.out.println("Case #"+(j+1)+": "+test(numGooglers,surprising,p,t) );
            }
        }catch(Exception e)
        {

        }
    }

    public int test(int n , int s , int p, int[] t)
    {
        int count = 0 ;
        int surprising = s;

        for(int i = 0 ; i < t.length; i++)
        {
            if(t[i] == 0 )
            {
                if(p == 0) count++;
                continue;
            }
            int a = t[i]/3;
            int b  = a * 3;
            int rem = t[i] - b;
            if(a >= p) {

                count++;
            }
            else
            {
                if((surprising != 0) && rem == 0 && (a + 1 >= p)) {
                    surprising--;
                    count++;
                    continue;
                }
                if( rem == 1 && a+1 >=p)
                {
                    count++;
                }
                if(rem == 2)
                {
                    if(a + 1 >= p )
                    {
                        count++;
                        continue;
                    }
                    if(surprising != 0 && a+2 >=p)
                    {
                        surprising--;
                        count++;
                    }
                }
            }


        }

        return count;

    }
}
