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.*;

public class Main{
    public static void main(String[] args){
	Scanner sc = new Scanner(System.in);

	int T = sc.nextInt();
	int caseNum = 0;

	while(caseNum++<T){

	    int n = sc.nextInt();
	    int s = sc.nextInt();
	    int p = sc.nextInt();
	    int[] t = new int[n];
	    for(int i=0; i<n; i++){
		t[i] = sc.nextInt();
	    }
	    int[][] triplet = new int[n][3];
	    for(int i=0; i<n; i++){
		triplet[i][0] = t[i]/3;
		triplet[i][1] = t[i]/3;
		triplet[i][2] = t[i]/3;
		int tmp = 0;
		for(int j=t[i]%3; j>0; j--){
		    triplet[i][tmp++]++;
		}
	    }

	    int ans = 0;
	    for(int i=0; i<n; i++){
		if(triplet[i][0]>=p && triplet[i][0]!=triplet[i][1]){
		    ans++; triplet[i][0] = -1;
		}
		else if(triplet[i][0]!=triplet[i][1]){
		    triplet[i][0] = -1;
		}
		else if(triplet[i][0]>=p){
		    ans++; triplet[i][0] = -1;
		}
		else if(triplet[i][1]>0){
		    triplet[i][0]++; triplet[i][1]--;
		}
	    }

	    int count = 0;
	    for(int i=0; i<n; i++){
		if(triplet[i][0]>=p){count++;}
	    }
	    if(count>=s){ans += s;}
	    else {ans += count;}

	    System.out.println("Case #"+caseNum+": "+ans);
	}
    }
}
