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.File;
import java.io.PrintWriter;
import java.util.Scanner;


public class B {

	int ref;
	
	int[] scores = new int[3];
	
	int max1=0;
	
	int max2=0;
	
		
	public B(int ref, int suma) {
		super();
		this.ref = ref;
		scores[0] = suma/3;
		suma-=scores[0];
		scores[1] = suma/2;
		scores[2] = suma-scores[1];
		max1 = scores[2]>=ref?1:0;	
		if (suma>=2 && suma <= 28)
			max2 = (scores[2]+1)>=ref?1:0;
		else
			max2=-1;
		//System.out.println(Arrays.toString(scores));
		/*if(ref==scores[0])
			max2--;
		if(scores[1]>=ref)
			max2++;
		if((scores[2]+1)>=ref)
			max2++;
		int tmpMax = 0;
		if(ref==scores[0])
			tmpMax--;
		if(scores[1]+1>=ref)
			tmpMax++;
		if((scores[2])>=ref)
			tmpMax++;
		if(tmpMax>max2)
			max2=tmpMax;
			*/		
	}



	public static void main(String[] args) throws Exception{
		Scanner sc = new Scanner(new File("B-large.in"));
		PrintWriter pw = new PrintWriter(new File("B-large.out"));
		int cases = sc.nextInt();
		for (int i = 0; i < cases; i++) {
			int n = sc.nextInt();
			int s = sc.nextInt();
			int ref = sc.nextInt();
			B[] scores = new B[n];
			boolean[] excep = new boolean[n];
			for (int j = 0; j < n; j++) {
				scores[j] = new B(ref,sc.nextInt());
			}
			for (int j = 0; j < s; j++) {
				int max = -10;
				int index = -1;
				for (int k = 0; k < excep.length; k++) {
					if(excep[k])
						continue;
					if(scores[k].max2-scores[k].max1 > max){
						max = scores[k].max2-scores[k].max1;
						index = k;
					}
				}
				excep[index]=true;
			}
			int res=0;
			for (int j = 0; j < excep.length; j++) {
				if(excep[j])
					res+=scores[j].max2;
				else
					res+=scores[j].max1;
			}
			//System.out.println(Arrays.toString(excep));
			pw.println("Case #"+(int)(i+1)+": "+res);
			
		}
		pw.close();
	}
	
	
}
