/**
 * 
 */
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.util.*;
import java.lang.*;
import java.io.*;

class googler
{
    public static void main(String args[])
    {
	try
	{
	    PrintWriter pw=new PrintWriter("out.txt"); 
	    //creating file reader instance and reading first line
	    BufferedReader br=new BufferedReader(new FileReader(args[0]));
	    String line=br.readLine();
	    int T=Integer.parseInt(line); //number of test cases T
	    //-------------------------
	    for(int i=0;i<T;++i)
	    {
		String[] testcase=br.readLine().split(" ");
		int N = Integer.parseInt(testcase[0]);
		int S = Integer.parseInt(testcase[1]);
		int p = Integer.parseInt(testcase[2]);
		if(p==0)
		{
		    //System.out.println("Case #"+(i+1)+": " + N);
		    pw.println("Case #"+(i+1)+": " + N);
		    continue;
		}

		int answer=0;
		for(int j=1;j<=N;++j)
		{
		    int total=Integer.parseInt(testcase[2+j]);
		    if(total==0)
			continue;
		    int x=total/3;
		    //if(x>=p)
		    //{
		    //	answer++;
		    //	continue;
		    //}
		    int modulo=total%3;
		    switch(modulo)
		    {
		    case 0:
			if(x>=p)
			{
			    answer++;
			}
			else if((x+1)>=p && S>0)
			{
			    answer++;
			    S--;
			}
			break;
		    case 1:
			if((x+1)>=p)
			    answer++;
			break;
		    case 2:
			if((x+1)>=p)
			{
			    answer++;
			}
			else if((x+2)>=p && S>0)
			{
			    answer++;
			    S--;
			}
			break;
		    }//end switch
		}

       		//System.out.println("Case #"+(i+1)+": " + answer);

		pw.println("Case #"+(i+1)+": " + answer);
		/*------------------------**/
	    }
	    br.close();
	    pw.close();
	}//end of try
	catch(Exception e)
	{
	    System.out.println("Exception caught: "+e);
	}	
   } 
}