/*
 * 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.util.Scanner;

public class cj1 {
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int T = s.nextInt();
		for (int i = 1; i<=T; i++) {
			int N = s.nextInt();
			int S = s.nextInt();
			int p = s.nextInt();
			int nc=0;
			int nawt=0;
			int nbwt=0;
			int naw=0;
			int nbw=0;
			int delta=0;
			for (int j = 1; j<=N; j++) {
				int ti = s.nextInt();
				if (ti==0) {
					if(ti==p) {
						nbw++;
						nbwt++;
					}
					continue;
				}
				if((ti-1)%3==0) {
					if ((ti+2)/3>=p) nc++;
				}
				if(ti%3==0){
					if(ti/3>=p) {
						nbw++;
						nbwt++;
					}
					else if((ti+3)/3>=p) nbw++;
				}
				if((ti+1)%3==0) {
					if ((ti+1)/3>=p) {
						naw++;
						nawt++;
					}
					else if ((ti+4)/3>=p) naw++;
				}
			}
			if(S<=(naw+nbw-nawt-nbwt)) delta=S;
			else delta=naw+nbw-nawt-nbwt;
			int max = nc + nawt + nbwt + delta;
			System.out.println("Case #" + i + ": "+ max);
		}
	}
}
