/**
 * 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();
    }
}

import java.io.*;
import java.util.*;

public class GoogleCount{
	
	public GoogleCount(String line, int i, BufferedWriter out){
		int count=0;
		try {
//			ArrayList<Goods> gooda = new ArrayList();
//			TreeSet<Integer> goods = new TreeSet();
			StringTokenizer token = new StringTokenizer(line);
			out.write("Case #"+Integer.toString(i)+": ");
			String str = null;
			Goods cur;
			int countS=0, countG=0;
	  		while (token.hasMoreTokens()){
				str = token.nextToken();
				int totG=Integer.parseInt(str);

				str = token.nextToken();
				int totS=Integer.parseInt(str);

				str = token.nextToken();
				int best=Integer.parseInt(str);

				int curr,temp;
				while (token.hasMoreTokens() && count<totG){
					str = token.nextToken();
					curr=Integer.parseInt(str);
					
					if(curr>=best){
						if (curr-best>=((best-1)*2)){

							countG++;
						}
						else if(curr-best>=((best-2)*2) && countS<totS){

							countS++;
							countG++;
						}
					}
					count++;
				}
			}
			out.write(Integer.toString(countG));
			System.out.print("\n");
			out.write("\n");
		}
		catch (IOException ex){
		      ex.printStackTrace();	    		
		}	
	}		
}
