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

public class ProblemB
{
	public static void main(String[] args)
	{
		//try { System.setIn(new FileInputStream("B-small-attempt0.in")); } catch (Exception e) { }
		//try { System.setOut(new PrintStream("B-small-0-out.txt")); } catch (Exception e) { }
		
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 1; t <= T; t++)
		{
			int N = sc.nextInt();
			int S = sc.nextInt();
			int P = sc.nextInt();
			
			int[] score = new int[N];
			for (int i = 0; i < N; i++) score[i] = sc.nextInt();
			
			int c = 0, s = 0;
			for (int i = 0; i < N; i++)
			{
				int[] tr = getBests(score[i]);
				if (P <= tr[0])
				{
					c++;
				}
				else if (P <= tr[1])
				{
					s++;
				}
			}
			c += Math.min(s, S);
			System.out.printf("Case #%d: %d\r\n", t, c);
		}
	}
	
	private static int[] makeTriple(int n)
	{
		int b = n / 3;
		int[] tr = { b, b, b };
		for (int i = 0; i < n % 3; i++) tr[i]++;
		return tr;
	}
	
	private static int[] getBests(int n)
	{
		int k = n / 3;
		int a = k, b = k + 1;
		if (n % 3 != 0) a++;
		if (n % 3 == 2) b++;
		else if (k - 1 < 0) b = 0;
		return new int[] { a, b };
	}
}
/*
4
3 1 5 15 13 11
3 0 8 23 22 21
2 1 1 8 0
6 2 8 29 20 8 18 18 21
*/