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 com.codejam2012;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Scanner;

public class Problem2 {

	public static void main(String[] args) throws Exception{
		Scanner sc = new Scanner(new FileReader("B-large.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("output1.txt"));
		
		int T = Integer.parseInt(sc.nextLine());
		for (int i=0; i<T; i++){
			
			String tempInput = sc.nextLine();
			String [] range = tempInput.split(" ");
			int N = Integer.parseInt(range[0]);
			int S = Integer.parseInt(range[1]);
			int p = Integer.parseInt(range[2]);
			int rem, quo, pCal, y = 0;
			int [] t = new int[N];
			for(int j=0;j<N;j++){
				t[j] = Integer.parseInt(range[j+3]);
				System.out.println(t[j]);
				quo = t[j] / 3;
				rem = t[j] % 3;
				System.out.println(t[j]+":quo:"+quo+":rem:"+rem);
				if(quo >= p || (quo == p-1 && rem !=0)){
					y++;
					System.out.println(t[j]+"Default True");
				}
				else if (quo < p-2 || (quo == p-2 && rem !=2)){
					System.out.println(t[j]+"Default False");
				}
				else if((quo == p-2 && rem == 2&& quo!=0)||(quo == p-1 && rem == 0&& quo!=0)){
					if(S>0){
						y++;
						S--;
						System.out.println(t[j]+"True");
					}
					else{
						System.out.println(t[j]+"False");
					}
				}
				else if((quo == p-2 && rem == 2&& quo==0 && p==0)||(quo == p-1 && rem == 0&& quo==0 && p==0)){
					y++;
				}
			}
			System.out.println("Case #"+(i+1)+": "+y);
			pw.write("Case #"+(i+1)+": "+y+"\n");
		}
		pw.flush();
		pw.close();
		sc.close();
	}
	
	static boolean checkP(){
		
		
		return true;
	}
	
}


