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.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import java.util.StringTokenizer;


public class ProblemBDancingWithTheGooglers {
	
	private static int lines;
	private static Scanner input;
	private static String [] outputs;
	
	public static void main(String[] args) {
		try {
			input = new Scanner(new FileReader(args[0]));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
			System.exit(-1);
		}
		lines = Integer.parseInt(input.nextLine());
		outputs = new String [lines];
		for(int i = 1; i<=lines; i++)
		{
			int maxVal;
			int num;
			int supriseCase;
			int iAns = 0;
			String ans = "Case #" + i + ": ";
			StringTokenizer str = new StringTokenizer(input.nextLine());
			num = Integer.parseInt(str.nextToken());
			supriseCase = Integer.parseInt(str.nextToken());
			maxVal = Integer.parseInt(str.nextToken());
			for(int j = 0; j<num; j++)
			{
				Triplet t = new Triplet(Integer.parseInt(str.nextToken()));
				if(t.highest()>=maxVal)
				{
					iAns++;
				}
				else if(supriseCase>0 && (t.highest() + 1)>= maxVal && t.highest() != t.sum && t.canBeSuprise())
				{
					supriseCase--;
					iAns++;
				}
				
			}
			ans += iAns;
			outputs[i-1] = ans;
			
		}
		try{
			 
    	    File file =new File("outputB.txt");
 
    	    //if file doesnt exists, then create it
    	    if(!file.exists()){
    		file.createNewFile();
    	    }
 
    	    FileWriter fw = new FileWriter(file.getName());
    	    BufferedWriter bw = new BufferedWriter(fw);
    	    for(int k = 0; k<outputs.length; k++)
    	    {
    	    	bw.write(outputs[k]);
    	    	bw.newLine();
    	    }
    	    bw.close();
    	    
		}catch(IOException e){
    		e.printStackTrace();
    	}

	}
	public static class Triplet {
		public static int sum, x, y, z;
		public Triplet(int i)
		{
			sum = i;
			x = (int) Math.round(((double)sum)/3.0);
			y = (int) Math.round(((double)sum)/3.0);
			z = sum - x - y;
		}
		public static boolean canBeSuprise()
		{
			return ((x==y && x==z) || x>z);
		}
		public static boolean allEqual()
		{
			return (x==y && x==z);
		}
		public static int highest()
		{
			if(x>=y)
			{
				if (x>=z)
				{
					return x;
				}
				else
				{
					return z;
				}
			}
			else
			{
				if(y>=z)
				{
					return y;
				}
				else
				{
					return z;
				}
			}
		}
	}

}
