/*
 * 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.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.StringTokenizer;


public class ProblemB {
	public static void main(String [] args) throws NumberFormatException, IOException
	{
		BufferedReader r = new BufferedReader( new FileReader("C:\\Users\\ÐÐÐ\\Downloads\\B-small-attempt1.in"));
		ArrayList<String> s = new TestCaseReader().read(r);
		s = new ProblemB().remap(s);
		OutputPrinter p = new OutputPrinter();
		for (String str : s)
			p.print(str);
		p.m_writer.flush();
		p.m_writer.close();
		
	}

	private ArrayList<String> remap(ArrayList<String> s) {
		ArrayList<String> remapped = new ArrayList<String>();
		for (String str : s)
		{
			
			StringTokenizer tk = new StringTokenizer(str, "  ");
			
			int n_googlers = Integer.parseInt(tk.nextToken());
			int n_surprises = Integer.parseInt(tk.nextToken());
			int target_score = Integer.parseInt(tk.nextToken());
			int total = 0;
			
			for (int i = 0 ; i < n_googlers ; i ++ )
			{
				int score = Integer.parseInt(tk.nextToken());
				int score_div = score % 3;
				int score_avg = score /3;
				
				if (score < target_score)
					continue;
				
				if (score_avg  >= target_score&& score_div == 0)
					total++;
				else
				if (score_div > 0 && score_avg  >= target_score -1 )
				{
					total++;
				}
				else
				if (n_surprises > 0)
				{
					int avg_rest_of_score = (score - target_score)/2;
					if (score_avg >= target_score -2 && (target_score - avg_rest_of_score) <= 2)
					{
						total ++;
						n_surprises --;
					}
				}
				
			}
			remapped.add("" +total);
		}
		return remapped;
	}
}
