import java.util.*;
import java.io.*;

public class DancingWithTheGooglers
{
    public DancingWithTheGooglers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("inputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        DancingWithTheGooglersMax [] rnc = new DancingWithTheGooglersMax[t];
        
        int i, j;
        int [] scores;
        int s, p;
        for(i = 0; i < t; i++)
        {
            scores = new int [inFile.nextInt()];
            s = inFile.nextInt();
            p = inFile.nextInt();
            for(j = 0; j < scores.length; j++)
                scores[j] = inFile.nextInt();
            
            rnc[i] = new DancingWithTheGooglersMax(i, scores, s, p, results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("outputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new DancingWithTheGooglers();
    }
    
    private class DancingWithTheGooglersMax extends Thread
    {
        int id;
        int s, p;
        int [] results, scores;
        
        public DancingWithTheGooglersMax(int i, int [] aScores, int aS, int aP,int [] res)
        {
            id = i;
            s = aS;
            p = aP;
            results = res;
            scores = aScores;
        }
        
        public void run()
        {
            int a = 0, b = 0;
            
            if(p == 0)
                results[id] = scores.length;
            else if(p == 1)
            {
                int y;
                y = 3*p - 3;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > 0)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
            else
            {
                int y, z;
                y = 3*p - 3;
                z = 3*p - 5;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > z)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
        }
    }
}
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;

public class B {

	PrintWriter out;

	public void read() throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("B-large.in"));
		out = new PrintWriter(new FileWriter("B-large.out"));
		int n = Integer.parseInt(br.readLine());
		int i = 0;
		String line;
		while (i < n) {
			line = br.readLine();
			solve(i + 1, line);

			i++;
		}

		out.close();
		out.flush();
	}

	public void solve(int c, String line) {

		int max = 0;
		String[] tokens = line.split(" ");
		out.print("Case #" + c + ": ");

		List<Integer> t = new ArrayList<Integer>();
		Integer N = Integer.parseInt(tokens[0]);
		Integer S = Integer.parseInt(tokens[1]);
		Integer p = Integer.parseInt(tokens[2]);

		
			for (int i = 3; i < (N + 3); i++) {
				if (Integer.parseInt(tokens[i]) >= p)
					t.add(Integer.parseInt(tokens[i]));
			}
			
			for (int x = 0; x < t.size(); x++) {
				int sub = t.get(x) - p;

				if (sub >= (2 * p)) {
					max = max + 1;
				} else {
					if (p + (p - 1) > sub) {
						if ((p - 1) + (p - 1) > sub) {
							if (S > 0) {
								if ((p - 2) + p > sub) {
									if ((p - 2) + (p - 1) > sub) {
										if ((p - 2) + (p - 2) > sub) {
											continue;
										} else if ((p - 2) + (p - 2) == sub) {
											max = max + 1;
											S = S - 1;
										}
									} else if ((p - 2) + (p - 1) == sub) {
										max = max + 1;
										S = S - 1;
									}
								} else if ((p - 2) + p == sub) {
									max = max + 1;
									S = S - 1;
								}
							}
						} else if ((p - 1) + (p - 1) == sub) {
							max = max + 1;
						}
					} else if (p + (p - 1) == sub) {
						max = max + 1;
					}
				}
			}
		

		out.print(max);
		out.println();
	}

	public static void main(String[] args) throws IOException {
		new B().read();
	}
}
