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

public class b {

	public static void main(String[] args) throws IOException
	{
		Scanner qwe = new Scanner(new File("b.in"));
		BufferedWriter out = new BufferedWriter(new FileWriter("b.out"));
		int t = qwe.nextInt();
		for(int i = 1; i <= t; i++)
		{
			int n = qwe.nextInt();
			int s = qwe.nextInt();
			int p = qwe.nextInt();
			
			int[] totals = new int [n];
			for(int j= 0; j < n; j++)
			{
				totals[j] = qwe.nextInt();
			}
			
			Arrays.sort(totals);
			
			int count = 0;
			for(int j = n-1; j >= 0; j--)
			{
				if(p == 0)
					count++;
				else if(totals[j] == 0)
					break;
				else if(p + 2*(p-1) <= totals[j])
					count++;
				else if(s > 0 && p >=2 && p + 2*(p-2) <= totals[j] )
				{
					count ++; 
					s --;
				}
				else
					break;
			}
			
			out.write("Case #" + i + ": " + count +  "\n");
		}
		out.close();
	}
}

