package com.example;

import java.io.IOException;
import java.util.List;

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}

   import java.io.*;
   import java.util.*;

   public class goog {
      static int surprise;
      public static void main (String [] args) throws Exception {
         BufferedReader f = new BufferedReader(new FileReader("goog.in"));
         PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("goog.out")));
         int N = Integer.parseInt(f.readLine());
         for(int i = 0; i<N; i++){
            String s = f.readLine();
            StringTokenizer st = new StringTokenizer(s);
            int[] hi = new int[Integer.parseInt(st.nextToken())];
            surprise = Integer.parseInt(st.nextToken());
            int p = Integer.parseInt(st.nextToken());
            for(int j = 0; j<hi.length; j++)
               hi[j] = Integer.parseInt(st.nextToken());
            Arrays.sort(hi);
            int count = 0;
            for(int j = hi.length-1; j>=0; j--)
               if(could(hi[j], p))
                  count++;
            out.println("Case #"+(i+1)+": "+count);
         }
         out.close();
         System.exit(0);
      }
      public static boolean could(int i, int greq){
         int[] t = new int[]{Math.max(0, greq-1), Math.max(0, greq-1), greq};
         int sum = 0;
         for(int e:t)
            sum+=e;
         if(sum<=i)
            return true;
         if(surprise>0){
            surprise--;
            t = new int[]{Math.max(0, greq-2), Math.max(0, greq-2), greq};
            sum = 0;
            for(int e:t)
               sum+=e;
            if(sum<=i)
               return true;
         }
         return false;
         // if(i>=3*(greq-1)+1)
            // return true;
         // if(greq == 2){
            // if(greq<2)
               // return false;
            // if(surprise>0)
            // {
               // surprise--;
               // return true;
            // }
            // return false;
         // }
         // if(i<Math.max(greq, 3*(greq-2)+2))
            // return false;
         // if(surprise>0)
         // {
            // surprise--;
            // return true;
         // }
         // return false;
      }
   }