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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class DancingWithGooglers {

	public static void main(String[] args) {

		try {

			BufferedReader br = new BufferedReader(new FileReader("input.txt"));
			BufferedWriter bw = new BufferedWriter(new FileWriter("output.txt"));

			int K, N, S, p, i, j;

			K = Integer.parseInt(br.readLine());
			for (i = 0; i < K; i++) {

				String[] line = br.readLine().split(" ");
				N = Integer.parseInt(line[0]);
				S = Integer.parseInt(line[1]);
				p = Integer.parseInt(line[2]);

				int[] data = new int[line.length - 3];
				for (j = 0; j < data.length; j++) {
					data[j] = Integer.parseInt(line[j + 3]);
					// System.out.print(data[j] + " ");
				}
				// System.out.println();

				int counter = 0;
				for (j = 0; j < data.length; j++) {

					int a, b, c;

					int res;
					a = (int) Math.floor((double) data[j] / 3);
					res = data[j] - a;
					b = (int) Math.floor((double) res / 2);
					res = res - b;
					c = res;

					if (a >= p || b >= p || c >= p) {
						counter++;
					} else if ((a + b + c) != 0 && (a + b + c) != 1) {
						int temp = (p - a) + (p - b) + (p - c);

						if (temp == 3 && S > 0) {

							counter++;
							S--;
						} else if (temp == 4 && S > 0) {
							counter++;
							S--;

						}
					}

				}
				bw.write("Case #" + (i+1) + ": " + counter);
				bw.newLine();

			}
			br.close();
			bw.close();

		} catch (IOException io) {
		}

	}

}
