/*
 * 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);
        }


    }
}

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;


public class Dance {

	static int getMaxGooglers(int N,int S, int p, int[] t) {
		int count=0;
		int surpriseCount=0;
		
		int avg=p*3;
		for(int i=0;i<N;i++) {
			
			/*if(t[i]>=avg)
				count++;
			
			else */
			if(t[i]>=p) {
				if(t[i]>=avg-2)
			
				count++;
			
			else if(surpriseCount<S)
			{
				if(t[i]>=avg-4) {
					count++;
					surpriseCount++;
				}
			}
			}
		}
		return count;
	}
	public static void main(String args[]) {
		try {
			BufferedReader br=new BufferedReader(new InputStreamReader(new FileInputStream("c:\\gcj\\B\\B-small-attempt1.in")));
			String line=br.readLine();
			PrintStream ps=new PrintStream("c:\\gcj\\B\\B-small1.out");
			
			int n=Integer.parseInt(line);
				for(int i=1;i<=n;i++) {
					
					line=br.readLine();				
					String[] nums=line.split(" ");
					int N=Integer.parseInt(nums[0]);
					int S=Integer.parseInt(nums[1]);
					int P=Integer.parseInt(nums[2]);
					int t[]=new int[N];
					for(int j=0;j<N;j++)
					{
						t[j]=Integer.parseInt(nums[j+3]);
					}
					ps.println("Case #"+i+": "+getMaxGooglers(N, S, P, t));
											
				}
			} 
			catch(Exception e) {
				e.printStackTrace();
			}
			
			
		}
		

	public static void ain(String[] args) {
		// TODO Auto-generated method stub
		
		int N=2;
		int S=1;
		int p=1;
		int[] t={8,0};
		System.out.println(" count : " + getMaxGooglers(N, S, p, t));
	}

}
