/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

package com.seol.codejam;


import java.io.File;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;

/**
 * Solution for http://code.google.com/codejam/contest/1150485/dashboard#s=p1
 */
public class DancingWithTheGooglers {

	public static int solveCase(int[] scores, int surpriseNum, int neededScore) {
		int len = scores.length;
		int maxWithNeeded = neededScore*3;
		int suprCnt = surpriseNum;
		int res=0;
		for(int i = 0; i < len; i++) {
			if(scores[i] < neededScore) {
				continue;
			}else if(scores[i] >= maxWithNeeded ||  maxWithNeeded - scores[i] <= 2) {
				res++;
			} else if (maxWithNeeded - scores[i] <= 4 && suprCnt > 0){
				suprCnt--;
				res++;
			}
		}
		
		return res;	
	}


	
	public static void main(String[] args) throws Exception {
		
		solveAllCases("D:/worspaces/google_codejam/test_data/dance2");
	}

	public static void solveAllCases(String fileName) throws Exception {
		Scanner sc = new Scanner(new File(fileName));
		int cases = sc.nextInt();
//		String tmp = sc.nextLine();
		for (int i = 0; i < cases; i++) {
			int n = sc.nextInt();
			int surp = sc.nextInt();
			int score = sc.nextInt();
			int[] ar = new int[n];
			for(int q =0; q < n; q++) {
				ar[q] = sc.nextInt();
			}
			int res = solveCase(ar, surp, score);
			
			System.out.println("Case #" + (i + 1) + ": " + res);
			// System.out.printf("Case #%1$d: %2$.7f \n" , (i+1), res);

		}
		// System.out.println("MAX:" + max);
	}

}
