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

class Triplet
{
	public static void main (String [] args) throws IOException 
	{
		BufferedReader in = new BufferedReader(new FileReader("B-large.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B-large.out")));
		
		StringTokenizer st = new StringTokenizer(in.readLine());
		int numCases = Integer.parseInt(st.nextToken());
		
		for (int i = 0; i < numCases; i++)
		{
			out.print("Case #" + (i+1) + ": ");
			
			st = new StringTokenizer(in.readLine());
			
			int n = Integer.parseInt(st.nextToken());
			int numSurprisings = Integer.parseInt(st.nextToken());
			int P = Integer.parseInt(st.nextToken());
			
			int min = 0;
			int minNoSurprising = 0;
			
			if (P > 1)
			{
				min = 3*P - 4;
				minNoSurprising = 3*P - 2;
			}
			else if (P == 1)
			{
				min = 1;
				minNoSurprising = 1;
			}
			else
			{
				min = 0;
				minNoSurprising = 0;
			}
			
			int[] totalPoint = new int[n];
			
			for (int j = 0; j < n; j++)
			{
				totalPoint[j] = Integer.parseInt(st.nextToken());
			}
			
			int maxCandidateWithNoSurprisings = 0;
			int maxCandidateWithSurprisings = 0;
			
			for (int j = 0; j < n; j++)
			{
				if (totalPoint[j] >= minNoSurprising)
				{
					maxCandidateWithNoSurprisings++;
				}
				else if (totalPoint[j] >= min)
				{
					maxCandidateWithSurprisings++;
				}
			}
			
			if (maxCandidateWithSurprisings <= numSurprisings)
			{
				out.print((maxCandidateWithNoSurprisings + maxCandidateWithSurprisings));
			}
			else
			{
				out.print((maxCandidateWithNoSurprisings + numSurprisings));
			}
			
			out.println();
		}
		
		out.close();
	}
}