/**
 * 
 */
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.*;

public class GoogleQual2012B
{   public static void main(String[] args) throws Throwable
    {   new GoogleQual2012B();
    }
    
    public GoogleQual2012B() throws Throwable
    {   Scanner in = new Scanner(new File("B-small-attempt2.in"));
        PrintWriter out = new PrintWriter(new FileWriter("B-small-attempt2.out"));
        int numTests = in.nextInt();
        for (int i = 0; i < numTests; i++)
        {   int numGoogs = in.nextInt();
            int numSuprsLeft = in.nextInt();
            int threshhold = in.nextInt();
            int total = 0;
            for (int j = 0; j < numGoogs; j++)
            {   int currTriple = in.nextInt();
                if (maxScore(currTriple) >= threshhold)
                {   total++;
                }
                else if (numSuprsLeft > 0 && maxScoreWithSurp(currTriple) >= threshhold)
                {   total++;
                    numSuprsLeft--;
                }
            }
            out.println("Case #" + (i + 1) + ": " + total);
        }
        out.close();
    }
    
    int maxScore(int total)
    {   if (total % 3 == 0)
        {   return total / 3;
        }
        return (total / 3) + 1;
    }
    
    int maxScoreWithSurp(int total)
    {   if (total == 0)
        {   return 0;
        }
        if (total % 3 == 2)
        {   return (total / 3) + 2;
        }
        return (total / 3) + 1;
    }
}