/*
 * 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 DancingWiththeGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new DancingWiththeGooglers().fun();
	}
	
	private void fun()
	{
		String file = "D:/CodeJam/inputB.in";
		try {
			scan = new Scanner(new File(file));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		
		int cases = scan.nextInt();
		
		for(int i = 1; i <= cases ; i++)
		{
			int noOfGooglers = findTheResult();
			System.out.println("Case #"+i+": "+noOfGooglers);
		}
	}
	
	private int findTheResult()
	{
		int googlers = scan.nextInt();
		int surprising = scan.nextInt();
		int minScore = scan.nextInt();
		int minValue = getMinValue(minScore);
		int criticValue1 = minValue;
		int criticValue2 = criticValue1 + 1;
		int count = 0;
		int criticalCount = 0;
		for(int i = 0; i< googlers; i++)
		{
			int score = scan.nextInt();
			if(minValue == 0)
			{
				count++;
				continue;
			}
			else if(minValue == 1)
			{
				if(score >= minValue)
					count++;
				continue;
			}
			if(score >= minValue)
			{
				if(score == criticValue1 || score == criticValue2)
				{
					if(criticalCount < surprising)
					{
						count++;
						criticalCount++;
					}
				}
				else
					count++;
			}
		}
		return count;
	}
	
	private int getMinValue(int minScore)
	{
		int value = 0;
		if(minScore > 2)
		{
			value = minScore - 2;
			value = minScore + value*2;
		}
		else
			value = minScore;
		
		return value;
	}
	
	Scanner scan = null;
}
