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


}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.util.Scanner;

/**
 *
 * @author leonardo
 */
public class Dance {
    
    static boolean canBeSurprising(int x1, int x2, int x3) {                
        if (x1 > 10 || x2 > 10 || x3 > 10)
            return false ;
        
        return (Math.abs(x1 -x2) >= 2) || (Math.abs(x1 -x3) >= 2) || (Math.abs(x2 -x3) >= 2) ;
    }
    
    /*static boolean canBeSurprising(int r, int x, int p) {                
        boolean[] res = new boolean[2] ;
        
        if (r == 0) {
            return canBeSurprising(x, x, x) || canBeSurprising(x-1, x+1, x) ;           
        }        
        else if (r == 1) {
            return canBeSurprising(x+1, x, x, p, res) || canBeSurprising(x+1, x+1, x-1) ;
        }
        else {
            canBeSurprising(x+2, x, x, p, res);
            canBeSurprising(x, x+1, x+1, p, res) ;        
        }
        return (! res[0] && res[1]) ? 1 : 0;
    }*/

    public static void main(String[] args) {               
        Scanner scanner = new Scanner(System.in) ;
        int inputSize = Integer.parseInt(scanner.nextLine()) ;
                
        for(int i = 1; i <= inputSize; i++) {
            String[] numbers = scanner.nextLine().split(" ") ;
                    
            int n = Integer.parseInt(numbers[0]) ;
            int s = Integer.parseInt(numbers[1]) ;
            int p = Integer.parseInt(numbers[2]) ;
            
            int count = 0 ;
            for(int googler = 0; googler < n; googler++) {
                int score = Integer.parseInt(numbers[googler + 3]) ;
                
                int r = score % 3 ;
                int x = score / 3 ;
                
                if (r == 0) {
                    
                    // possible maxs: x and x + 1
                    
                    if (x >= p)
                        count++ ;
                    else if ((score > 0) && s > 0 && (x + 1) >= p) {
                        s-- ;
                        count++ ;
                    }
                        
                }
                
                // r == 1 -> max = x + 1
                else if (r == 1 && (x + 1 >= p))
                    count++ ;
                
                else {
                                        
                   // possible maxs: x + 1 and x + 2 
                    
                   if ((x + 1) >= p)
                        count++ ;
                   else if ((x+2 <= 10) && (x+2 >= p) && (s > 0)) {
                        count++ ;
                        s-- ;
                    }
                }
            }
            System.out.println("Case #" + i + ": " + count) ;
        }                
    }
}

