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;
    }
}

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class Dancing
{
    public static void main(String[] args) throws FileNotFoundException
    {
        Scanner sc = new Scanner(new File("inputs/dancing.in"));
        
        int cases = sc.nextInt();
        
        for (int i = 1; i <= cases; i++)
        {
            int googs = sc.nextInt();
            int surprises = sc.nextInt();
            int min = sc.nextInt();

            int num = 0;
            
            for (int j = 0; j < googs; j++)
            {
                int curr = sc.nextInt();

                int remain = curr - min;

                if (remain < 0)
                {
                    continue;
                }
                else if (remain / 2 >= (min - 1))
                {
                    num++;
                }
                else if (surprises > 0 && (remain / 2 == (min - 2)))
                {
                    num++;
                    surprises--;
                }
            }
            
            System.out.printf("Case #%s: %s\n", i, num);
        }
    }
}
