/**
 * 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.util.HashMap;
import java.util.Map;
import java.util.Scanner;


public class QuestionA extends Question{

	private static Map<Character, Character> translationMap;
	private static boolean isInit;
	private StringBuilder sb;
	
	public QuestionA(Result result, Counter counter)
	{
		super(result, counter);
		if (!isInit) {
			init();
			isInit=true;
		}
	}
	
	private void init() {
		translationMap = new HashMap<Character, Character>();
		String text = "zyeq"+"ejp mysljylc kd kxveddknmc re jsicpdrysi"+"rbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcd"+"de kr kd eoya kw aej tysr re ujdr lkgc jv";
		String translation = "qaoz"+"our language is impossible to understand"+"there are twenty six factorial possibilities"+"so it is okay if you want to just give up";
		for (int i = 0; i < text.length(); i++) {
			if (!translationMap.containsKey(text.charAt(i)))
				translationMap.put(text.charAt(i), translation.charAt(i));
		}
	}

	@Override
	public void readInput(Scanner scanner) {
		sb = new StringBuilder();
		sb.append(scanner.nextLine());
	}
	
	@Override
	public String solution() {
		for (int i = 0; i < sb.length(); i++) {
			sb.setCharAt(i, translationMap.get(sb.charAt(i)));
		}
		return sb.toString();
	}


}
