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

public class B {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("B-small-attempt0.in"));
		String li;
		int tcn = Integer.parseInt(in.readLine());
		Scanner sc;
		int N, S, P;
		int[] scr;
		for (int tc = 0; tc < tcn; tc++) {
			li = in.readLine();
			sc = new Scanner(li);
			N = sc.nextInt(); S = sc.nextInt(); P = sc.nextInt();
			scr = new int[N];
			for (int i = 0; i < N; i++) {
				scr[i] = sc.nextInt();
			}
			
			Arrays.sort(scr);
			
			int result = 0;
			for (int i = scr.length - 1; i >=0; i--) {
				int tmp = scr[i] / 3;
				if (P - tmp >= 3 || (scr[i] == 0 && P > 0)) break;
				int r = scr[i] % 3;
				if (tmp >= P) {
					result++;
				} else {
					if (P - tmp == 1) {
						if (r > 0) {
							result++;
						} else {
							if (S > 0) {
								result++;
								S--;
							}
						}
					} else {
						if (P -tmp == 2) {
							if (r == 2 && S > 0) {
								result++;
								S--;
							}
						}
					}
				}
			}
			
			System.out.println("Case #" + (tc + 1) + ": " + result);
		}
		in.close();
	}

}
