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.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.StringTokenizer;

/**
 * 
 */

/**
 * @author Bageshwar
 *
 */
public class Dance {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		

		
		BufferedReader fr = new BufferedReader(new FileReader(new File(args[0])));
		String str =fr.readLine();
		System.out.println(str);
		int lines = Integer.parseInt(str);
		FileWriter writer = new FileWriter(new File(args[1]));
		StringTokenizer stk ;
		for(int i=0;i<lines;i++){
		
			str = fr.readLine();
			stk = new StringTokenizer(str," ");
			int c = Integer.parseInt((String) stk.nextElement());
			int surprize = Integer.parseInt((String) stk.nextElement());
			int high = Integer.parseInt((String) stk.nextElement());
			int data[] = new int[c];
			int triplets[][] = new int[c][3];
			boolean surprizeFlag=(surprize==0);
			int surprizeCount=0;
			int countHigh=0;
			System.out.print("Case #("+surprize+")"+(i+1));
			writer.write("Case #"+(i+1)+": ");
			System.out.print(" "+high+": ");
			for(int j=0;j<c;j++){
				data[j]=Integer.parseInt((String) stk.nextElement());
				triplets[j]=getTriplets(data[j],surprizeFlag,high);
				if(isSurprize(triplets[j]) && (++surprizeCount)>=surprize)
					surprizeFlag=true;
			
				System.out.print(data[j]+"="+Arrays.toString(triplets[j])+" ");
				if(isHigh(triplets[j],high))
					countHigh++;
			}
			System.out.println(countHigh+"");
			writer.write(countHigh+"\r\n");
		}
		writer.close();
		fr.close();
		
	}
	
	private static boolean isHigh(int[] is,int h) {
		if(is[0]>=h || is[1]>=h || is[2]>=h)
			return true;
		return false;
	}

	static boolean isSurprize(int[] a ){
		if(Math.abs(a[0]-a[1])>1)
			return true;
		
		if(Math.abs(a[0]-a[2])>1)
			return true;
		
		if(Math.abs(a[1]-a[2])>1)
			return true;
		
		return false;
			
	}

	
	private static int[] getTriplets(int x,boolean surprizeFlag,int high){
		
		if(x==0)
		return new int[]{0,0,0};
		//int x=20;
		int a,b,c;
		a=x/3;
		int t=3*a-x;
		if(t%2==0){
			//adjusting for highest
			if( (a>=high || (a-t/2) >=high) ||  
					((a-t/2)+1)<high ||
					surprizeFlag){
				b=(a-t/2);
				c=b;
			}else{
				System.out.print("(!)");
			b=(a-t/2)+1;
			c=b-2;
			}
			//b=b+1;
			//c=c-1;
		}else {
			//remainder is 1 ! 
			b=a;
			c=b-t;
		}
		//System.out.printf("%d %d %d",a,b,c);
		return new int[]{a,b,c};
		
	}
}
