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.*;
import java.util.*;
import java.math.BigInteger;
public class B{
public static void main(String []args) throws Exception {
                BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	int t, x = 0, n, s, p, ans;
	t = Integer.parseInt(br.readLine());
	while(t>0) {t--; x++;
	ans = 0;
	String w = br.readLine();
	String arr1[] = w.split("[ ]+");
	n = Integer.parseInt(arr1[0]);
	s = Integer.parseInt(arr1[1]);
	p = Integer.parseInt(arr1[2]); 
	int a = 0, a1 = 1, r = 2;
	for(int i = 0; i < n; i++) {r++;
		a = Integer.parseInt(arr1[r]);
		int b = (a/3);
		int c = b*3;
		int d = (b+1)*3;
		int e = 0;
		 if(b >= p) { ans++; e = 1;}
		if(e == 0) { if((c+1) == a && (b+1) >= p) { ans++; e = 1;}
			else if((c+2) == a && (b+1) >= p){ans++; e = 1;}
		}
		if(e == 0 && a1 <= s) {
			if(c > 0 && (c) == a && (b+1) >= p) { ans++; a1++;}
			else if((c+1) == a && (b+1) >= p) { ans++; a1++;}
			else if((c+2) == a && (b+2) >= p) { ans++; a1++;}
		}
	}
			
		System.out.println("Case #"+x+": "+ans);
        	}
	}
}
