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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.io.Reader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Set;


public class Main 
{

public static HashMap<Character,Character> mapp = new HashMap<Character,Character>();

public static void main(String[] args) throws Exception
{
	PrintWriter writer = new PrintWriter(new FileWriter("output.txt"));
	BufferedReader input = new BufferedReader(new FileReader("B-large.in"));
	int size=Integer.parseInt(input.readLine());
	for(int i=0; i<size; i++)
	{
		String testCase = input.readLine();
		String tokens[] = testCase.split(" ");
		int N = Integer.parseInt(tokens[0]);
		int S = Integer.parseInt(tokens[1]);
		int p = Integer.parseInt(tokens[2]);
		int count=0;
		//ArrayList<Integer> google = new ArrayList<Integer>();
		for(int j=3; j<N+3; j++)
		{
			int testNum = Integer.parseInt(tokens[j]);
			if((testNum - p) >= 2*(p-1) && (testNum-p)>=0)
			{
				count++;
			}
			else if((testNum - p) < 2*(p-1) && (testNum-p)>=0)
			{
				if(S!=0 && (testNum - p) >= 2*(p-2) )
				{
					count++;
					S--;
				}
			}
		}
		writer.println("Case #"+(i+1)+": "+count);
	}
	writer.close();
	input.close();
}

}