/*
 * 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.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

public class Test {
	static BufferedReader reader;
	static StringTokenizer tokenizer;
	static PrintWriter writer;

	static int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	static long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	static double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}

	static String nextToken() throws IOException {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			tokenizer = new StringTokenizer(reader.readLine());
		}
		return tokenizer.nextToken();
	}

	public static void main(String[] args) throws IOException {
		reader = new BufferedReader(new InputStreamReader(new FileInputStream("b.in")));
		tokenizer = null;
		writer = new PrintWriter("b.out");
		solve();
		reader.close();
		writer.close();
	}

	private static void test() throws IOException
	{
		int n = nextInt();
		int s = nextInt();
		int p = nextInt();
		
		int[] sum = new int[n];
		for(int i=0;i<n;i++)
		{
			sum[i]=nextInt();
		}
		
		int res=0;
		
		for(int i=0;i<n;i++)
		{
			if(sum[i]==0)
			{
				if(p==0)
					res++;
				continue;
			}
			
			if(sum[i]==1)
			{
				if(p<=1)
					res++;
				continue;
			}
			
			if((sum[i]+2)/3>=p)
			{
				res++;
				continue;
			}
			
			if(s>0)
			{
				if((sum[i]+4)/3>=p)
				{
					s--;
					res++;
				}
			}
		}
		writer.print(res);
	}
	
	private static void solve() throws IOException {		
		int t = nextInt();
		for(int i=1;i<=t;i++)
		{
			writer.print("Case #"+i+": ");
			test();
			writer.println();
		}
	}
}
