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



///REMOVE ALL OUTPUT AND USE STRINGTOKENIZER!


/*
ID: mfranzs1
LANG: JAVA
TASK: DancingWithTheGooglers
*/
import java.io.*;
import java.util.*;

public class DancingWithTheGooglers {
	static BufferedReader f;
	public static void main (String [] args) throws IOException {
		long unixTime = System.currentTimeMillis();
		// Use BufferedReader rather than RandomAccessFile; it's much faster
		f = new BufferedReader(new FileReader("DancingWithTheGooglers.in"));
	                                                  // input file name goes above
	    PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("DancingWithTheGooglers.out")));

	    
	    int lines=Integer.parseInt(f.readLine());
	    
	    for(int i=0;i<lines;i++){
	    	StringTokenizer st = new StringTokenizer(f.readLine()," ");
	    	int bestOfAtLeastP=0;
	    	int numGooglers=Integer.parseInt(st.nextToken());
	    	int suprising=Integer.parseInt(st.nextToken());
	    	int p=Integer.parseInt(st.nextToken());
	    	int suprisingLeft=suprising;
	    	for(int g=0;g<numGooglers;g++){
	    		int total = Integer.parseInt(st.nextToken());
	    		System.out.println(total+" "+Math.ceil(total/3D)+" "+p+" "+((total-p)/2D));
	    		if(Math.ceil(total/3D)>=p){
	    			bestOfAtLeastP++;
	    		}else{
	    			//Has to be suprising
	    			if(total>=p){
		    			if(suprisingLeft>0){
		    				if((total-p)/2D>=p-2){
			    				suprisingLeft--;
			    				bestOfAtLeastP++;
		    				}
		    			}
	    			}
	    		}
	    	}
	    	System.out.println("Case #"+(i+1)+": "+bestOfAtLeastP);
	    	out.println("Case #"+(i+1)+": "+bestOfAtLeastP);
	    }
	    
	    out.close();                                  // close the output file
	    
	    System.out.println("Time elapsed (ms): "+(System.currentTimeMillis()-unixTime));
	    
	    System.exit(0);                               // don't omit this!
	  }
}