import java.util.Scanner;
import java.io.*;
class dance
{
  public static void main (String[] args) throws IOException
  { 
    File    inputData = new File("B-small-attempt0.in");
	File 	outputData= new File("Boutput.txt");
    Scanner scan = new Scanner( inputData );
	PrintStream print= new PrintStream(outputData);
    
	int t;
	int n,s,p,pi;
	t= scan.nextInt();
	for(int i=1;i<=t;i++)
	{
	n=scan.nextInt();	s=scan.nextInt();	p=scan.nextInt();
	int supTrip=0, notsupTrip=0;
	
	for(int j=0;j<n;j++)
	{
		pi=scan.nextInt();
		if(pi>(3*p-3))
		notsupTrip++;
		else if((pi>=(3*p-4))&&(pi<=(3*p-3))&&(pi>p))
		supTrip++;
	}
	
	if(s<=supTrip)
	notsupTrip=notsupTrip+s;
	else if(s>supTrip)
	notsupTrip= notsupTrip+supTrip;
	print.println("Case #"+i+": "+notsupTrip);
	}
  }
}
//package com.GoogleCodeJam.y2012.Qualification.DancingWithTheGooglers;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

public class DancingWithTheGooglers {
	public static void main(String[] args) {
		try {
			BufferedReader in = new BufferedReader(new FileReader(new File("B-small-attempt0.in")));
			int numCases = Integer.parseInt(in.readLine());
			for (int caseNum = 1; caseNum <= numCases; caseNum++) {
				String[] caseInput = in.readLine().split(" ");
				int numFound = getNumOverBar(caseInput);
				System.out.println("Case #"+ caseNum + ": " + numFound);
			}
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
	public static int getNumOverBar(String[] caseInput) {
		int numGooglers = Integer.parseInt(caseInput[0]);
		int surprisingRemaining = Integer.parseInt(caseInput[1]);
		int minThreshhold = Integer.parseInt(caseInput[2]);
		int numFound = 0;
		for (int scoreId = 3; scoreId < (numGooglers + 3); scoreId ++) {
			int givenScore = Integer.parseInt(caseInput[scoreId]);
			int checkedScore = givenScore %3 == 0 ? givenScore : (givenScore + 3 - givenScore %3);
			if (checkedScore/3 >= minThreshhold) {
				numFound ++;
			} else if (givenScore == 0) {
				if (minThreshhold == 0) {
					numFound++;
				}
			} else if (surprisingRemaining > 0) {
				if (givenScore % 3 == 2) {
					if ((givenScore + 4)/3 >= minThreshhold) {
						numFound ++;
						surprisingRemaining --;
					}
				} else if (givenScore % 3 == 0) {
					if ((givenScore+3) / 3 >= minThreshhold) {
						numFound ++;
						surprisingRemaining --;
					}
				}
			}
		}
		return numFound;

	}
}
