package util.graph;

import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Set;

public class DynDjikstra {
    public static State FindShortest(Node start, Node target) {
        PriorityQueue<Node> openSet = new PriorityQueue<>();
        Set<Node> closedSet = new HashSet<>();
        openSet.add(start);
        while (!openSet.isEmpty()) {
            Node current = openSet.poll();
            for (Edge edge : current.edges) {
                Node end = edge.target;
                if (closedSet.contains(end)) {
                    continue;
                }
                State newState = edge.travel(current.last);
                //if (end.equals(target)) {
                    //return newState;
                //}
                if (openSet.contains(end)) {
                    if (end.last.compareTo(newState)>0) {
                        end.last = newState;
                    }
                } else {
                    openSet.add(end);
                    end.last = newState;
                }
            }
            closedSet.add(current);
            if (closedSet.contains(target)) {
                return target.last;
            }
        }

        return target.last;
    }
}

package com.google.codejam;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class Dancing {	
	public static void main(String[] args) throws Exception {
		BufferedReader reader = new BufferedReader(new InputStreamReader(new FileInputStream("B-small-attempt0.in")));
		PrintWriter writer = new PrintWriter("output.txt");
		int n = Integer.parseInt(reader.readLine());
		for(int i = 1; i <= n; i++) {
			writer.print("Case #" + i + ": " + solve(reader.readLine()));
			writer.println();
		}
		reader.close();
		writer.close();
	}
	
	private static int solve(String line) {
		String[] datas = line.split(" ");
		int n = Integer.parseInt(datas[0]);
		int s = Integer.parseInt(datas[1]);
		int p = Integer.parseInt(datas[2]);
		int count = 0;		
		for (int i = 3; i < n + 3; ++i) {
			int t = Integer.parseInt(datas[i]);
			if (t >= p * 3) {
				++count;
				continue;
			}
			if (t < p) {
				continue;
			}
			int diff = (t - p) / 2;
			if (p - diff <= 1) {
				++count;
				continue;
			}
			if (p - diff == 2 && s > 0) {
				--s;
				++count;
			}
		}
		return count;
	}

}
