/*
 * 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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class E2 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner sc = null;
		
		//sc = new Scanner(System.in);
		
		try {
			sc = new Scanner(new File("E2.txt"));
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		
		int fases = sc.nextInt();
		
		
		for(int j=1; j<=fases; ++j){
			
			int N = sc.nextInt(); // players
			int S = sc.nextInt(); // surprising
			int P = sc.nextInt();
			
			int casos = 0;
			
			for(int i=0; i<N; ++i){
				int ti = sc.nextInt();
				
				int t = ti % 3;
				int base = ti / 3;

				
				if(t == 0){
					
					if(base >= P){
						casos++;
					}
					else if(S > 0 && base > 0 && base + 1 >= P){
						casos++;
						S--;
					}
					
				}
				else if(t == 1){
					if(base + 1 >= P){
						casos++;
					}
					else if(S > 0 && base + 1 >= P){
						casos++;
						S--;
					}
				}
				else{
					if(base + 1 >= P){
						casos++;
					}
					else if(S > 0 && base + 2 >= P){
						casos++;
						S--;
					}
				}
			}
			
			System.out.println("Case #" + j + ": " + casos);
		}
	}

}
