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.util.*;
import java.io.*;
public class B {
  public static void main (String[] args)throws Exception
  {
    String inputfilename = args[0];
    String outputfilename = args[1];
    BufferedReader br = new BufferedReader(new FileReader(inputfilename));
    BufferedWriter bw = new BufferedWriter(new FileWriter(outputfilename));
    int cases = Integer.valueOf(br.readLine());
    for(int i = 0; i < cases; i++) {
		String[] ele = br.readLine().split(" ");
		int n = Integer.valueOf(ele[0]);
		int s = Integer.valueOf(ele[1]);
		int p = Integer.valueOf(ele[2]);
		List<Integer> total = new ArrayList<Integer>();
		for(int j = 0; j < n; j++) {
			total.add(Integer.valueOf(ele[3 + j]));
		}
		int result = B.solve(n,s,p,total);
		bw.write("Case #" + (i + 1) + ": " + result + "\n");
    }

    
    br.close();
    bw.close();
  }
  public static int solve(int n,int s,int p,List<Integer> total)
  {
    int cnt = 0;
    for(Integer t : total) {
      int divide = t / 3;
      int left = t - divide * 3;
      if(divide >= p) {
		cnt++;
		continue;
      }
      if(left == 1) {
		if(divide + 1 >= p) cnt++;
      } else if(left == 2) {
		if(divide + 1 >= p) cnt++;
		else if(divide + 2 >= p && s > 0) {cnt++;s--;}
      } else if(divide > 0){
		if(divide + 1 >= p && s > 0) {cnt++;s--;}
      }
      
    }
    return cnt;
  }
}
