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.codejam.solution;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;

public class GoogleDance {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader reader=new BufferedReader(new FileReader(new File(System.getProperty("user.home")+File.separator+"Desktop"+File.separator+"input.txt")));
		PrintWriter output=new PrintWriter(new File(System.getProperty("user.home")+File.separator+"Desktop"+File.separator+"output.txt"));
		int cases=Integer.parseInt(reader.readLine());
		for(int i=0;i<cases;i++){
			output.print("Case #"+(i+1)+": ");
			String[] params=reader.readLine().split("\\s");
			int N=Integer.parseInt(params[0]);
			int S=Integer.parseInt(params[1]);
			int p=Integer.parseInt(params[2]);
			int[] totals=new int[N];
			for(int j=0;j<N;j++){
				totals[j]=Integer.parseInt(params[j+3]);
			}
			Arrays.sort(totals);
			int found=0;
			int track=0;
			int qualified=0;
			while(found<S && track<N){
				if(totals[track]>0){
					if(totals[track]%3==2){
						if((totals[track]/3)+2>=p){
							qualified++;
							found++;
						}
					}else if(totals[track]%3==0){
						if((totals[track]/3)+1>=p){
							qualified++;
							found++;
						}
					}else{
						if(totals[track]/3+1>=p){
							qualified++;
						}
					}
				}
				else{
					if(p==0){
						qualified++;
					}else{
						if(totals[track]%3==1){
							if(totals[track]/3+1>=p){
								qualified++;
							}
						}
					}
				}
				track++;
			}
			while(track<N){
				if(totals[track]>0){
					if(totals[track]%3>=1){
						if(totals[track]/3+1>=p){
							qualified++;
							track++;
							break;
						}
					}else{
						if(totals[track]/3>=p){
							qualified++;
							track++;
							break;
						}
					}
				}else{
					if(p==0){
						qualified++;
						track++;
						break;
					}
				}
				track++;
			}
			if(track<N){
				qualified+=N-track;
			}
			output.print(qualified);
			output.println();
		}
		output.close();
		reader.close();
	}
}