/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

//package dancing_with_googler;

import java.io.BufferedInputStream;
import java.io.BufferedWriter;
import java.io.FileOutputStream;
import java.io.OutputStreamWriter;
import java.util.Scanner;

public class Solution {

	/**
	 * @param args
	 */
	public void doit() throws Exception{
		BufferedWriter out = new BufferedWriter(new OutputStreamWriter(new
		         FileOutputStream(java.io.FileDescriptor.out), "ASCII"), 512);
		Scanner s = new Scanner(new BufferedInputStream(System.in));
		int cases = s.nextInt();
		for(int i=0;i<cases;i++){
			int N = s.nextInt();//# of googler
			int S = s.nextInt();//# of suprising
			int P = s.nextInt();//expected value
			int score[] = new int[N];
			int non_surprising[] = {0,1,4,7,10,13,16,19,22,25,28};
			int surprising[] = {2,2,2,5,8,11,14,17,20,23,26};
			int count = 0;
			for(int j=0;j<N;j++){
				score[j] = s.nextInt();
				if(non_surprising[P]<=score[j]){
					count++;
				}else if(S>0&&surprising[P]<=score[j]){
					S--;count++;
				}
			}
			out.append("Case #" + (i+1) + ": " + count);
			out.append('\n');
		}
		out.flush();
	}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Solution s = new Solution();
		try{
			s.doit();
		}catch(Exception e){
			e.printStackTrace();
		}
	}

}
