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.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class B {
	
	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(new File("B-small.in"));
		FileWriter fw = new FileWriter("B-small.out");
		
		int T = in.nextInt();
		
		for (int tc = 1; tc <= T; tc++) {
			int count = 0;
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int[] totalScores = new int[N];
			int special = 0;
			for(int i = 0; i < N; i++) {
				totalScores[i] = in.nextInt();
				if(totalScores[i] >= 3) {
					int remainder = totalScores[i] % 3;
					int mid = totalScores[i] / 3;
					
					if(remainder == 0) {//mid mid mid or mid-1 mid mid+1;
						if(mid >= p)
							count++;
						else if(mid+1 >= p && special < S) {
							special++;
							count++;
						}
					} else if(remainder == 1) {//mid mid mid+1 or mid-1 mid+1 mid+1
						if(mid >= p)
							count++;
						else if(mid+1 >= p)
							count++;
						
					} else {//mid mid+1 mid+1 or mid mid mid+2
						if(mid >= p)
							count++;
						else if(mid+1 >= p)
							count++;
						else if(mid+2 >= p && special < S) {
							special++;
							count++;
						}
					}
				} else {
					if((totalScores[i] == 0 && p == 0) || (totalScores[i] == 1 && p <= 1))
						count++;
					else if(totalScores[i] == 2) {
						if(p <=1) {
							count++;
						} else if(p == 2 && special < S) {
							special++;
							count++;
						}
					}
				}
				
			}
			
			fw.write ("Case #" + tc + ": " + count + "\n");
		}
		fw.flush();
		fw.close();
	}

}
