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;
   }
}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package uk.co.epii.codejam.dancingwiththegooglers;

import uk.co.epii.codejam.common.AbstractProcessor;
import uk.co.epii.codejam.common.Processor;


/**
 *
 * @author jim
 */
public class DancingWithTheGooglersProcessor extends AbstractProcessor {
    
    public int[] getB(int t) {
        switch (t) {
            case 0: return new int[] {0,0};
            case 29: return new int[] {10,10};
            case 30: return new int[] {10,10};
        }
        switch (t % 3) {
            case 0:
                return new int[] {t /3, t / 3 + 1};
            case 1:
                return new int[] {(t + 2) / 3, (t + 2) / 3};
            case 2:
                return new int[] {(t + 1) / 3, (t + 4) / 3};
        }
        throw new IllegalArgumentException("Your t value has defied the "
                + "peano axioms");
    }

    @Override
    public String processLine(String line) {
        DataRow dr = new DataRow(line);
        int mustReach = 0;
        int canOnlyReachWithSurprisingResult = 0;
        for (int t : dr.t) {
            int[] b = getB(t);
            if (b[0] >= dr.p)
                mustReach++;
            else if (b[1] >= dr.p)
                canOnlyReachWithSurprisingResult++;
        }
        int surprisingContribution = Math.min(dr.S, 
                canOnlyReachWithSurprisingResult);
        return (mustReach + surprisingContribution) + "";
    }
    
    
}
