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.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class GooglerIdol {

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

		File sample = new File(
				"D:/Feng/Workspace/googlecodejam2012/problemB/in/sample.in");
		
		File in = new File(
				"D:/Feng/Workspace/googlecodejam2012/problemB/in/B-large.in");

		try {
			BufferedWriter out = new BufferedWriter(new FileWriter(
					"D:/Feng/Workspace/googlecodejam2012/problemB/out/outlarge.txt"));
			StringBuilder s;
			String line = "";
			int googlers, surprises, p = 0;
			int[] totalScores;
			int idols, chances = 0;
			int count = 1;
			Scanner scanner = new Scanner(in);
			// Ignore the first line showing total count
			scanner.nextLine();
			while (scanner.hasNextLine()) {
				s = new StringBuilder("Case #");
				s.append(count);
				s.append(": ");
				line = scanner.nextLine();

				String[] tokens = line.split(" ");
				googlers = Integer.parseInt(tokens[0]);
				surprises = Integer.parseInt(tokens[1]);
				p = Integer.parseInt(tokens[2]);
				totalScores = new int[googlers];
				for (int i = 3; i < tokens.length; i++) {
					totalScores[i - 3] = Integer.parseInt(tokens[i]);
				}
				Arrays.sort(totalScores);

				idols = 0;
				chances = surprises;
				for (int j = googlers - 1; j >= 0; j--) {
					if (pass(p, totalScores[j], false)) {
						idols++;
					}
					else if (chances > 0 && pass(p, totalScores[j], true)) {
						idols++;
						chances--;
					}
				}

				s.append(idols);
				/*
				s.append("\ngooglers:");
				s.append(googlers);
				s.append(" surprises:");
				s.append(surprises);
				s.append(" p:");
				s.append(p);
				s.append("\nTotal Scores");
				s.append(Arrays.toString(totalScores));
				*/

				System.out.println(s);
				out.write(s.toString());
				out.newLine();
				count++;
			}
			scanner.close();
			out.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

	public static boolean pass(int p, int totalScore, boolean surprise) {

		if (p == 0)
			return true;
		
		if (totalScore == 0)
			return false;

		int avg = totalScore / 3;
		if (avg >= p)
			return true;
		
		int diff = totalScore - (3 * avg);

		if (p - avg == 1 && diff > 0) {
			return true;
		}
		
		if (surprise && p - avg == 1 && diff == 0) {
			return true;
		}

		if (surprise && p - avg == 2 && diff > 1) {
			return true;
		}

		return false;
	}
}
