/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

import java.io.*;
import java.util.*;

class GoogleDance
{
	public static void main(String[] args)
	{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		Scanner sc=new Scanner(new InputStreamReader(System.in));
		int t=sc.nextInt();
		String ans[]=new String[t];
		for(int i=0;i<t;i++)
		{
			int n,s,p,b=0;
			n=sc.nextInt();
			s=sc.nextInt();
			p=sc.nextInt();
			
			for(int j=0;j<n;j++)
			{
				int tot=sc.nextInt();
				int quo,rem;
				quo=tot/3;
				rem=tot%3;
				if(rem==0)
				{
					if(quo>=p)
					{
						b++;
						continue;
					}
					else if((quo+1)==p)
					{
						if(s>0)
						{
							if((quo-1)>0)
							{
								s--;
								b++;
								continue;
							}
						}
					}
				}
				else if(rem==1)
				{
					if((quo+1)>=p)
					{
						b++;
						continue;
					}
				}
				else if(rem==2)
				{
					if((quo+1)>=p)
					{
						b++;
						continue;
					}
					else if((quo+2)>=p)
					{
						if(s>0)
						{
							s--;
							b++;
							continue;
						}
					}
				}
			}
			ans[i]="Case #"+(i+1)+": "+b;
		}
		for(int i=0;i<t;i++)
			System.out.println(ans[i]);
	}
}
