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.IOException;
import java.util.Arrays;
import java.util.Collections;

public class DancingWithGooglers {

	public static void main(String[] args) throws IOException{
		FileReader inf = new FileReader("data/B-large.in"); 
		BufferedReader in = new BufferedReader(inf); 
		FileWriter outf = new FileWriter("result/B-large.out");  
		BufferedWriter out = new BufferedWriter(outf);  
		int numCases = Integer.parseInt(in.readLine());  
		int numGoogler = 0;
		int numSuprising = 0;
		int p = 0;
		int maxResult = 0;
		
		for(int index = 1; index <=numCases; index++)
		{
			/*Begin to get data*/
			String line = in.readLine();  
			String []tokens = line.split(" ");
			numGoogler = Integer.parseInt(tokens[0]);
			numSuprising = Integer.parseInt(tokens[1]);
			p = Integer.parseInt(tokens[2]);
			Integer [] scores = new Integer[numGoogler];
			int k = 0;
			maxResult = 0;
			for(int i = 3; i < tokens.length; i++)
			{
				scores[k++] = Integer.parseInt(tokens[i]);
			}
			/*End of getting data*/
			
			/*Reverse the order*/
			Arrays.sort(scores, Collections.reverseOrder());
			for(int i = 0; i < scores.length;i++)
			{
				if(scores[i] >= 3*p)
				{
					maxResult++;
				}
				else if(scores[i] < p)
				{
					continue;
				}
				else if((scores[i]>=(3*p - 2)) && (scores[i]<= (3*p -1)))
				{
					maxResult++;
				}
				else if((scores[i]>=(3*p - 4)) && (3*p - 4) > 0)
				{
					if(numSuprising > 0)
					{
						maxResult ++;
						numSuprising--;
					}
				}
				else
				{
					continue;
				}
			}
			System.out.println("Case #"+index+": "+maxResult);
			out.write("Case #"+index+": "+" "+maxResult);
			out.newLine();
			out.flush();
		}
		
	}
	
}
