/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

import java.io.*;
import java.util.*;

public class GCJ2Edit{
  
  
  public static void main(String args[])throws Exception{
    
//    Scanner Input = new Scanner(System.in);
    Scanner Input = new Scanner(new File("B-small-attempt3.in"));
    
    int TC = Input.nextInt();
    
    int NG;
    
    int [] Scores;
    int P;
    int Surprise;
    
    int Combos;
    
    for(int i = 0; i<TC; i++){
      
      NG = Input.nextInt();
      
      Scores = new int[NG];
      Surprise = Input.nextInt();
      P = Input.nextInt();
      int count = 0;
      int [] Indi;
      
      for(int j = 0; j<NG; j++){
        
        Scores[j] = Input.nextInt();
        
      }
      
      Indi = new int[3];
      
      for(int j = 0; j<NG; j++){
        
        if(Scores[j]%3 == 0){
          Indi[0] = Scores[j]/3;
          Indi[1] = Scores[j]/3;
          Indi[2] = Scores[j]/3;
        }
        else if(Scores[j]%3 == 1){
          Indi[0] = (Scores[j]/3)+1;
          Indi[1] = (Scores[j]-Indi[0])/2;
          Indi[2] = (Scores[j]-Indi[0])/2;
        }
        else if(Scores[j]%3 == 2){
          Indi[0] = (Scores[j]/3)+1;
          Indi[1] = ((Scores[j]-Indi[0])/2)+1;
          Indi[2] = (Scores[j]-Indi[0])/2;
        }
        
        if(Indi[0]>=P){
          count++;
        }
        
        else{
          if(Scores[j]%3==0){
            Indi[0] = Indi[0]+1;
            Indi[1] = Indi[1]-1;
            if(Indi[0]>=P && Indi[1]>=0){
              if(Surprise == 0){
                if(Math.abs(Indi[0]-Indi[1])<2&&Math.abs(Indi[2]-Indi[1])<2&&Math.abs(Indi[0]-Indi[2])<2)
                  count++;
              }
              else{
                if(Math.abs(Indi[0]-Indi[1])<=2&&Math.abs(Indi[2]-Indi[1])<=2&&Math.abs(Indi[0]-Indi[2])<=2){
                  count++;
                }
              }
            }
            else if (Surprise>0){
              Indi[0] = Indi[0]+1;
              Indi[1] = Indi[1]-1;
              if(Indi[0]>=P && Indi[1]>=0){
                if(Math.abs(Indi[0]-Indi[1])<=2&&Math.abs(Indi[2]-Indi[1])<=2&&Math.abs(Indi[0]-Indi[2])<=2){
                  count++;
                  Surprise--;
                }
              }
            }
          }
          else if(Surprise>0){
            Indi[0] = Indi[0]+1;
            Indi[1] = Indi[1] - 1;
            if(Indi[0]>=P&&Indi[1]>=0){
              if(Math.abs(Indi[0]-Indi[1])<=2&&Math.abs(Indi[2]-Indi[1])<=2&&Math.abs(Indi[0]-Indi[2])<=2){
                count++;
                Surprise--; 
              }
            }
          }
        }
        
        
      }
      System.out.println("Case #" + (i + 1) + ": " + count);
    }
    
  }
  
}