import java.util.*;
public class Test {
  public static void main(String[] args){
    Scanner in = new Scanner(System.in);
    int T = in.nextInt();

    for(int i = 1; i<=T; i++) {
      int n = in.nextInt();
      int s = in.nextInt();
      int p = in.nextInt();
      int result = 0;
      for(int j = 0; j<n; j++){
        int x = canAddUp(in.nextInt(), p);
        if(x == 0) {
          result++;
        } else if (x==1 && s > 0) {
          result++;
          s--;
        }
      }
      System.out.println("Case #"+i+": "+result);
    }
  }

  public static int canAddUp(int sum, int limit) {
    boolean flag = false;
    for(int i = 0; i<=sum; i++) {
      for(int j = 0; i+j <= sum; j++) {
        int k = sum-(i+j);
        int a = Math.abs(i-j);
        int b = Math.abs(i-k);
        int c = Math.abs(j-k);
        if(a > 2 || b > 2 || c> 2){
          continue;
        }

        if (i>=limit || j>=limit || k>=limit) {
          if(a < 2 && b < 2 && c < 2) {
            return 0;
          }else{
            flag = true;
          }
        }
      }
    }
    return (flag) ? 1 : 2;
  }
}

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

public class B implements Runnable
{	
	//private String IFILE = "input.txt";
	//private String IFILE = "B-small-attempt0.in";
	private String IFILE = "B-large.in";
	
	private Scanner in;
	private PrintWriter out;
	
	public void Run() throws IOException
	{
		in = new Scanner(new File(IFILE));
		out = new PrintWriter("output.txt");
		
		int ntest = in.nextInt();
		for(int test = 1; test <= ntest; test++)
		{
			out.print("Case #" + test + ": ");
			int n = in.nextInt();
			int m = in.nextInt();
			int p = in.nextInt();
			int[] mas = new int[n];
			for(int i = 0; i < n; i++)
				mas[i] = in.nextInt();

			int[] max1 = new int[31];
			for(int i = 1; i <= 10; i++)
				max1[Math.max(0, Math.min(30, 3 * i - 2))] = i; 
			int[] max2 = new int[31];
			for(int i = 1; i <= 10; i++)
				max2[Math.max(1, Math.min(30, 3 * i - 4))] = i;
			for(int i = 1; i <= 30; i++)
				max1[i] = Math.max(max1[i], max1[i - 1]);
			for(int i = 1; i <= 30; i++)
				max2[i] = Math.max(max2[i], max2[i - 1]);
			
			int n1 = 0;
			int n2 = 0;
			for(int i = 0; i < n; i++)
			{
				if (max1[mas[i]] >= p)
					n1++;
				else if (max2[mas[i]] >= p)
					n2++;
			}
			
			out.println(n1 + Math.min(n2, m));
		}
		
		in.close();
		out.close();
	}
	
	public void run()
	{
		try		
		{
			Run();
		}
		catch(IOException e)
		{
			
		}
	}

	public static void main(String[] args) throws IOException
	{
		new B().Run();
		//new Thread(new XXX()).start();
	}

}
