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;
  }
}

package codejam;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Googlers {
	public static void main(String[] args) throws IOException 
	{
		Scanner scan = new Scanner(new File("Googlers.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("Googlers.out")));
		
		
		int N = Integer.valueOf(scan.nextLine());
		int id =1;
		while(scan.hasNextLine())
		{
			String letters = scan.nextLine();
			String[] letter = letters.split(" ");
			
			int peopleNum =  Integer.valueOf(letter[0]);
			int superiNum =  Integer.valueOf(letter[1]);
			int score =  Integer.valueOf(letter[2]);
			int[] scores = new int[peopleNum];
			for(int i=0;i<peopleNum;i++)
			{
				scores[i] = Integer.valueOf(letter[i+3]);
			}
			
			int reslut   = algorithm(peopleNum, superiNum, score, scores);
			out.println("Case #" + id + ": " + reslut);
			
			
			out.println();
			id++;
		}
		out.close();

	}
	
	public static int algorithm(int peopleNum, int superiNum, int score,int[] scores)
	{
		int num = 0;
		int highScores = score * 3 - 2;
		int lowScores  = score * 3 - 4;
		
		//the case score=1
		if(lowScores <= 0) lowScores = 1;
		
		for(int item : scores)
		{
			if(item >= highScores)
				num ++;
			else
			{
				if(superiNum > 0)
				{
					if(item >= lowScores)
					{
						num++;
						superiNum --;
					}
				}
			}
		}

		return num;
	}

}
