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.util.Scanner;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Dancers
{
	public static void main(String[] args)
	{
		try
		{
			Scanner s = new Scanner(new File("dancers.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("dancers.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int numGooglers = s.nextInt();
				int surprising = s.nextInt();
				int p = s.nextInt();
				int lowerBoundWithoutSurprising = (p * 3) - 2;
				int lowerBoundWithSurprising = (p * 3) - 4;
				
				if(lowerBoundWithoutSurprising < p)
					lowerBoundWithoutSurprising = p;
				if(lowerBoundWithSurprising < p)
					lowerBoundWithSurprising = p;
				
				int count = 0;
				for(int m = 1; m <= numGooglers; m++)
				{
					int cur = s.nextInt();

					if(cur >= lowerBoundWithoutSurprising)
						count++;
					else if(cur >= lowerBoundWithSurprising && surprising > 0)
					{
						count++;
						surprising--;
					}
				}
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	

}