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

/**
 * 
 * @author luoyuan
 *
 */
package codejam;

import java.util.ArrayList;
import static java.lang.Math.*;

public class Dancing {

	public static void bestResult(String inF,String outF) {
		InOutTool iot = new InOutTool(inF,outF);
		ArrayList<String> js = new ArrayList<String>();
		for(int i=1;i<iot.size();i++){
			String in = iot.get(i).trim();
			String[] num = in.split(" ");
			int n = Integer.parseInt(num[0]), s = Integer.parseInt(num[1]), p = Integer.parseInt(num[2]);
			int sup=0,count=0;
			for(int k=3;k<num.length;k++){
				int i_0=0,i_1=0,i_2=0;
				int temp = Integer.parseInt(num[k]);
				i_0 = temp/3;
				if(i_0>=p){
					count ++;
				}else{
					if(i_0<(p-2)||(temp-i_0)<p||(temp-i_0)>(2*p+2)||(temp-i_0)<(2*p-2)){
						//no case want
					}else{//maybe surprising cases
						i_1 = p; i_2 = temp - i_0 - i_1;
						count ++;
						if(abs(i_2-i_0)>1||abs(i_2-i_1)>1)sup ++;
					}
				}
			}
			if(sup>s)count -= (sup-s);
			js.add("Case #" + i + ": " + count);
		}
		iot.clear();iot.addAll(js);
		iot.outText();
	}
	public static void main(String...args){
		Dancing.bestResult("B-small-attempt0.in", "B-small-attempt0.out");
	}
}
