package CodeJam.c2012.clasificacion;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

/**
 * Problem
 *
 * You're watching a show where Googlers (employees of Google) dance, and then
 * each dancer is given a triplet of scores by three judges. Each triplet of
 * scores consists of three integer scores from 0 to 10 inclusive. The judges
 * have very similar standards, so it's surprising if a triplet of scores
 * contains two scores that are 2 apart. No triplet of scores contains scores
 * that are more than 2 apart.
 *
 * For example: (8, 8, 8) and (7, 8, 7) are not surprising. (6, 7, 8) and (6, 8,
 * 8) are surprising. (7, 6, 9) will never happen.
 *
 * The total points for a Googler is the sum of the three scores in that
 * Googler's triplet of scores. The best result for a Googler is the maximum of
 * the three scores in that Googler's triplet of scores. Given the total points
 * for each Googler, as well as the number of surprising triplets of scores,
 * what is the maximum number of Googlers that could have had a best result of
 * at least p?
 *
 * For example, suppose there were 6 Googlers, and they had the following total
 * points: 29, 20, 8, 18, 18, 21. You remember that there were 2 surprising
 * triplets of scores, and you want to know how many Googlers could have gotten
 * a best result of 8 or better.
 *
 * With those total points, and knowing that two of the triplets were
 * surprising, the triplets of scores could have been:
 *
 * 10 9 10 6 6 8 (*) 2 3 3 6 6 6 6 6 6 6 7 8 (*)
 *
 * The cases marked with a (*) are the surprising cases. This gives us 3
 * Googlers who got at least one score of 8 or better. There's no series of
 * triplets of scores that would give us a higher number than 3, so the answer
 * is 3.
 *
 * Input
 *
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing integers
 * separated by single spaces. The first integer will be N, the number of
 * Googlers, and the second integer will be S, the number of surprising triplets
 * of scores. The third integer will be p, as described above. Next will be N
 * integers ti: the total points of the Googlers.
 *
 * Output
 *
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1) and y is the maximum number of Googlers who
 * could have had a best result of greater than or equal to p.
 *
 * Limits
 *
 * 1 â¤ T â¤ 100. 0 â¤ S â¤ N. 0 â¤ p â¤ 10. 0 â¤ ti â¤ 30. At least S of the ti values
 * will be between 2 and 28, inclusive.
 *
 * Small dataset
 *
 * 1 â¤ N â¤ 3.
 *
 * Large dataset
 *
 * 1 â¤ N â¤ 100.
 *
 * Sample
 *
 * Input Output 4 Case #1: 3 3 1 5 15 13 11 Case #2: 2 3 0 8 23 22 21 Case #3: 1
 * 2 1 1 8 0 Case #4: 3 6 2 8 29 20 8 18 18 21
 *
 * @author Leandro Baena Torres
 */
public class B {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader br = new BufferedReader(new FileReader("B.in"));
        String linea;
        int numCasos, N, S, p, t[], y, minSurprise, minNoSurprise;

        linea = br.readLine();
        numCasos = Integer.parseInt(linea);
        for (int i = 0; i < numCasos; i++) {
            linea = br.readLine();
            String[] aux = linea.split(" ");
            N = Integer.parseInt(aux[0]);
            S = Integer.parseInt(aux[1]);
            p = Integer.parseInt(aux[2]);
            t = new int[N];
            y = 0;
            minSurprise = p + ((p - 2) >= 0 ? (p - 2) : 0) + ((p - 2) >= 0 ? (p - 2) : 0);
            minNoSurprise = p + ((p - 1) >= 0 ? (p - 1) : 0) + ((p - 1) >= 0 ? (p - 1) : 0);
            for (int j = 0; j < N; j++) {
                t[j] = Integer.parseInt(aux[3 + j]);
                if (t[j] >= minNoSurprise) {
                    y++;
                } else {
                    if (t[j] >= minSurprise) {
                        if (S > 0) {
                            y++;
                            S--;
                        }
                    }
                }
            }

            System.out.println("Case #" + (i + 1) + ": " + y);
        }
    }
}

/**
 * Program : Test for google code jam
 * Author  : jenogg
 * Since   : 2012.04.14
 */
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;


public class Subject0102 {

	/** Mapping map */
	private Map<String, String> mapper;
	
	/**
	 * Construct
	 */
	public Subject0102() {
		init();
	}
	
	/**
	 * Initialize.
	 */
	private void init() {
		/*
			Input
			3
			ejp mysljylc kd kxveddknmc re jsicpdrysi
			rbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcd
			de kr kd eoya kw aej tysr re ujdr lkgc jv
	
			Output
			Case #1: our language is impossible to understand
			Case #2: there are twenty six factorial possibilities
			Case #3: so it is okay if you want to just give up
		*/
		String input  = " abcdefghijklmnopqrstuvwxyz";
		String output = " yhesocvxduiglbkrztnwjpfmaq";
		mapper = new HashMap<String, String>();
		for (int letter=0; letter < input.length(); letter++) {
			mapper.put(input.substring(letter,letter+1), output.substring(letter,letter+1));
		}
	}

	/**
	 * Test
	 */
	public void test() {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		String systemIn;
		int sentenceSize = 0;
		String[] sentence = new String[]{};
		try {
			//println("Input");
			systemIn = nvl(in.readLine());
			sentenceSize = getSentenceSize(systemIn);
			if (sentenceSize > 0) {
				sentence = new String[sentenceSize];
				for (int index = 0; index < sentenceSize; index++) {
					systemIn = in.readLine();
					sentence[index] = nvl(systemIn);
				}
				//println("\n-------------------------------------------\n");
				in.close();
				
				//println("Output");
				for (int index = 0; index < sentenceSize; index++) {
					print("Case #" + (index+1) + ": ");
					printSentence(sentence[index]);
				}
			}
		} catch (IOException e) {
			e.printStackTrace();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
	
	/**
	 * Gets size of sentences
	 * @param sentenceSize Sentence size
	 * @return Size of sentences
	 * @throws Exception
	 */
	private int getSentenceSize(String sentenceSize) throws Exception {
		return Integer.parseInt(nvl(sentenceSize, "0"));
	}

	/**
	 * Print mapping sentence
	 * @param sentence Source sentence
	 */
	private void printSentence(String sentence) {
		int success = 0;
		
		String[] data = sentence.split(" ");
		int dancers = Integer.parseInt(data[0]);
		int suprise = Integer.parseInt(data[1]);
		int cutline = Integer.parseInt(data[2]);
		
		if (cutline == 0) {
			success = dancers;
		} else {
			for (int index=0; index < dancers; index++) {
				int totalPoint = Integer.parseInt(data[3+index]);
				if (totalPoint == 0) {
					continue;
				}
				int basePoint = totalPoint / 3;
				int rest = totalPoint % 3;
				int canPoint  = basePoint;
				
				if (rest != 0) {
					canPoint++;
				}
				if (canPoint >= cutline) {
					success++;
					continue;
				}
				
				if (suprise > 0) {
					if (rest != 1) {
						canPoint++;
						if (canPoint >= cutline) {
							success++;
							suprise--;
							continue;
						}
					}
				}
			}
		}
		println(success);
	}
	
	/**
	 * Replace null to empty string
	 * @param string Input value of string
	 * @return If input string is null then empty string, otherwise trimmed input string
	 */
	private String nvl(String string) {
		return nvl(string, "");
	}

	/**
	 * Replace null to replace string
	 * @param string Input value of string
	 * @param replace Replace value of string
	 * @return If input string is null then empty string, otherwise trimmed input string
	 */
	private String nvl(String string, String replace) {
		return string == null ? "" : string.trim();
	}

	/**
	 * Print out
	 * @param obj Value of object
	 */
	private void print(Object obj) {
		System.out.print(obj);
	}
	
	/**
	 * Print line out
	 */
	private void println() {
		println("");
	}
	
	/**
	 * Print line out
	 * @param obj Value of object
	 */
	private void println(Object obj) {
		System.out.println(obj);
	}

	/**
	 * main
	 * @param args Arguments
	 */
	public static void main(String[] args) {
		Subject0102 subject = new Subject0102();
		subject.test();
	}
}
