package problem1;

import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;





public class Problem1 {

    public static void main(String[] args) throws FileNotFoundException, IOException{
        try {
             TextIO.readFile("L:\\Coodejam\\Input\\Input.txt");
        }
        catch (IllegalArgumentException e) {
              System.out.println("Can't open file ");
              System.exit(0);
         }
        
        FileOutputStream fout = new FileOutputStream("L:\\Coodejam\\Output\\output.txt");
        PrintStream ps=new PrintStream(fout);
        
        int cases=TextIO.getInt();
        int googlers=0,surprising=0,least=0;
        for(int i=0;i<cases;i++){
            int counter=0;
            googlers=TextIO.getInt();
            surprising=TextIO.getInt();
            least=TextIO.getInt();
            int score[]=new int[googlers];
            for(int j=0;j<googlers;j++){
                score[j]=TextIO.getInt();
                 }
            
            
            
            
            Arrays.sort(score);
            int temp=0;
            int sup[]=new int[surprising];
            
          for(int j=0;j<googlers && surprising>0;j++){
               if(biggestNS(score[j])<least && biggestS(score[j])==least){
                   surprising--;
                   counter++;
                }
               }
           
            for(int j=0;j<googlers;j++){
                if(surprising==0)temp=biggestNS(score[j]);
                    
                else {
                    temp=biggestS(score[j]);
                    surprising--;     
                } 
                   if(temp>=least)counter++;
           
             }
            
             ps.println("Case #"+(i+1)+": "+counter);
        }
    }
    
   static int biggestNS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-1)/3)+1;
   }
   
   static int biggestS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-2)/3)+2;
   }
}

import java.io.File;
import java.io.PrintWriter;
import java.util.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author xeyyam
 */
public class DancingWiththeGooglers {

    boolean[][] ansNoS = new boolean[31][11];
    boolean[][] ansS = new boolean[31][11];

    public static void main(String args[]) throws Exception {
        new DancingWiththeGooglers().solve();
    }

    public void solve() throws Exception {
        generate();

        Scanner sc = new Scanner(new File("B-small-attempt0.in"));
        PrintWriter pw = new PrintWriter("B-small-attempt0.out");
        int t, n, s, p;

        t = sc.nextInt();

        for (int i = 1; i <= t; i++) {
            n = sc.nextInt();
            s = sc.nextInt();
            p = sc.nextInt();
            int ans = 0;
            int temp = 0;
            
            for(int j = 1 ; j<=n ; j++ ){
                temp = sc.nextInt();
                if( check(temp , p , false) ) ans++;
                else if( s>0 && check(temp , p , true ) ){ ans++ ; s--;}
                
            }
            
            pw.println("Case #"+i+": "+ans);
        }

        pw.flush();
        pw.close();

    }
    
    public boolean check(int sum , int p , boolean surprise){
        
        if( !surprise )
        for(int i = p ; i<=10 ; i++){
            if( ansNoS[sum][i]  )
                return true;
        }
        else{
            
        for(int i = p ; i<=10 ; i++){
            if( ansS[sum][i]  )
                return true;
        }
        }
        
        return false;
    }

    public void generate() {
        for (int i = 0; i <= 10; i++) {
            for (int j = 0; j <= 10; j++) {
                for (int k = 0; k <= 10; k++) {
                    if (Math.abs(j - i) <= 1 && Math.abs(k - j) <= 1 && Math.abs(i - k) <= 1) {
                        ansNoS[i + j + k][i] = true;
                        ansNoS[i + j + k][j] = true;
                        ansNoS[i + j + k][k] = true;
                    } else if (Math.abs(j - i) <= 2 && Math.abs(k - j) <= 2 && Math.abs(i - k) <= 2) {
                        ansS[i + j + k][i] = true;
                        ansS[i + j + k][j] = true;
                        ansS[i + j + k][k] = true;
                    }
                }
            }
        }
    }
}
