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

public class ProblemB {

	public static void main(String[] args) throws Exception {

		// Scanner sc = new Scanner(new File("C:\\B-small-attempt0.in"));
		Scanner sc = new Scanner(System.in);
		int cases = Integer.parseInt(sc.nextLine().trim());
		for (int i = 0; i < cases; i++) {
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int[] val = new int[n];

			for (int j = 0; j < n; j++) {
				val[j] = sc.nextInt();
			}
			System.out.println("Case #" + (i + 1) + ": " + solve(s, p, val));
		}
	}

	private static int solve(int s, int p, int[] val) {

		int ret = 0;

		for (int v : val) {
			int x1, x2 = 0;

			
			if (v < 2) {
				x1 = v;
			} else if (v > 28) {
				x1 = 10;
			} else if (v % 3 == 1) {
				x1 = (v + 2) / 3;
			} else if (v % 3 == 0) {
				x1 = v / 3;
				if ((x1 == p - 1) && (s > 0)) {
					s--;
					x1++;
				}

			} else {
				x1 = (v + 1) / 3;
				if ((x1 == p - 1) && (s > 0)) {
					s--;
					x1++;
				}
			}
			if (x1 >= p)
				ret++;
		}

		return ret;

	}

}
