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

class results {
	public int numgooglers,numsurprising,p,counter = 0;
	public int[] scores;
	HashMap<Integer,Integer> maxifnotsurprising, maxifsurprising;

	results(int numgooglers, int numsurprising, int p,HashMap<Integer,Integer> maxifnotsurprising, HashMap<Integer,Integer> maxifsurprising) {
		this.numgooglers = numgooglers;
		this.numsurprising = numsurprising;
		this.p = p;
		scores = new int[numgooglers];
		this.maxifnotsurprising = maxifnotsurprising;
		this.maxifsurprising = maxifsurprising;
	}
	public void addscore(int i) {
		scores[counter] = i;
		counter++;
	}
	public int maxgreaterthanp() {
		int max = 0;
		int remainingsurprising = numsurprising;
		for (int i=0;i<numgooglers;i++) {
			if (maxifnotsurprising.get(scores[i])>=p) max++;
			else if (remainingsurprising>0 && scores[i] > 1 ) { //If it's surprising, minimum score is 2
				if (maxifsurprising.get(scores[i])>=p) {
					max++;
					remainingsurprising--;
				}
			}
		}


		return max;
	}

}

public class DancingWithGooglers {

	final static String inputfile = "B-large.in",outfile = "output.txt";
	static HashMap<Integer,Integer> maxifnotsurprising,maxifsurprising;


	public static void main(String[] args) {
		maxifnotsurprising = new HashMap<Integer,Integer>(); 
		maxifsurprising = new HashMap<Integer,Integer>(); 

		for(int i=0;i<11;i++) {				//Smallest
			for (int j=i;j<i+3;j++){		//Middle
				for (int k=j;k<i+3;k++) {
					//System.out.println(i+","+j+","+k);
					int sum = i+j+k;
					if (k-i == 2) { 	   //Is surprising
						if (!maxifsurprising.containsKey(sum)) maxifsurprising.put(sum, k);
						else if (maxifsurprising.get(sum)<k) maxifsurprising.put(sum, k);
					}
					else {
						if (!maxifnotsurprising.containsKey(sum)) maxifnotsurprising.put(sum, k);
						else if (maxifnotsurprising.get(sum)<k) maxifnotsurprising.put(sum, k);
					}
				}
			}
		}
		ArrayList<results> cases = new ArrayList<results>();
		Scanner sc = null;
		try {
			sc = new Scanner(new File(inputfile));
		} catch (FileNotFoundException e) {
			System.err.println("OHONEZ");
		}
		int numtestcases = sc.nextInt();
		for (int i=0;i<numtestcases;i++) {
			results temp = new results(sc.nextInt(), sc.nextInt(), sc.nextInt(),maxifnotsurprising,maxifsurprising);
			for (int j=0;j<temp.numgooglers;j++) temp.addscore(sc.nextInt());
			cases.add(temp);
		}
		FileWriter fstream = null;
		try {
			fstream = new FileWriter(outfile);
			BufferedWriter out = new BufferedWriter(fstream);
			for (int i=0;i<cases.size();i++) {
				System.out.println("Case #"+(i+1)+": "+cases.get(i).maxgreaterthanp());
				out.write("Case #"+(i+1)+": "+cases.get(i).maxgreaterthanp()+"\n");
			}
			out.close();
		} catch (IOException e) {}

	}

}
