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.Arrays;
import java.util.Scanner;


public class Main {
	public static void main(String[] args) {
		Scanner r = new Scanner(System.in);
		
		int T = r.nextInt();
		int caseNumber = 1;
		while(T-- > 0){
			int N = r.nextInt();
			int S = r.nextInt();
			int P = r.nextInt();
			
			int[] a = new int[N];
			for(int i = 0; i < N; i++)
				a[i] = r.nextInt();
			
			Arrays.sort(a);
			
			int ret = 0;
			for(int i = N - 1; i >= 0; i--){
				boolean need = true;
				for(int x = 0; x <= 10; x++)
				for(int y = 0; y <= 10; y++){
					int z = a[i] - x - y;
					if(z > 10 || z < 0)continue;
					
					int max = Math.max(x, Math.max(y, z));
					if(max >= P && (Math.abs(x - y) <= 1 && Math.abs(x - z) <= 1 && Math.abs(y - z) <= 1)){
						need = false;
					}
				}
				
				if(!need)ret++;
				else{
					if(S > 0){
						boolean can = false;
						
						for(int x = 0; x <= 10; x++)
						for(int y = 0; y <= 10; y++){
							int z = a[i] - x - y;
							if(z > 10 || z < 0)continue;
							
							int max = Math.max(x, Math.max(y, z));
							if(max >= P && (Math.abs(x - y) <= 2 && Math.abs(x - z) <= 2 && Math.abs(y - z) <= 2)){
								can = true;
							}
						}
						
						if(can){
							S--;
							ret++;
						}
					}
				}
			}
			System.out.printf("Case #%d: %d\n", caseNumber++, ret);
		}
	}
}
