/**
 * 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.*;

public class ProbB {
	
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in).useDelimiter("\n");
		
		int t = s.nextInt();
		String[] lines = new String[t];
		
		for(int i = 0; i < t; i++) {
			lines[i] = s.next();
		}
		
		s.close();
		
		for(int i = 0; i < t; i++) {
			//System.out.println(lines[i]);
			System.out.println("Case #" + (i+1) + ": " + solve(lines[i]));
		}
	}
	
	private static int solve(String ln) {
		Scanner s2 = new Scanner(ln);
		
		int n = s2.nextInt(); // Number of Googlers
		int s = s2.nextInt(); // Number of surprising cases
		int p = s2.nextInt(); // result of at least p?
		int[] tPoints = new int[n]; // array of each Googler's total points
		
		for(int i = 0; i < n; i++) {
			tPoints[i] = s2.nextInt();
			//System.out.println(tPoints[i]);
		}
		
		s2.close();
		
		int total = 0;
		int firstChk = Math.max(3*p - 2, p);
		int scdChk = Math.max(3*p - 4, p);
		
		for(int i = 0; i < n; i++) {
			
			if(tPoints[i] >= firstChk) {
				total++;
				continue;
			}
			else if((tPoints[i] >= scdChk) && (s > 0)) {
				total++;
				s--;
				continue;
			}
		}
		
		return total;
	}

}
