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;
            }
        }
    }
}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package qualification.Dancing;

import java.util.*;

/**
 *
 * @author farshid
 */
public class Dancing {

    public Dancing() {
    }

    public int solve(String problem) {
        String[] arr = problem.split(" ");

        int n = Integer.parseInt(arr[0]);
        int s = Integer.parseInt(arr[1]);
        int p = Integer.parseInt(arr[2]);
        int[] scores = new int[arr.length - 3];

        for (int i = 3; i < arr.length; i++) {
            scores[i - 3] = Integer.parseInt(arr[i]);
        }

        LinkedList<LinkedList<Combination>> combs =
                new LinkedList<LinkedList<Combination>>();

        for (int i = 0; i < scores.length; i++) {
            LinkedList<Combination> l = this.dancerPossibleCombs(scores[i], p);
            combs.add(l);
        }

        int max = this.processCombination(combs, s);

        return max;
    }

    public void test() {
    
    }

    private int processCombination(LinkedList<LinkedList<Combination>> combs, int maxSur) {

        int max = 0;
        int currentSur = 0;

        for (int i = 0; i < combs.size(); i++) {
            LinkedList<Combination> current = combs.get(i);
            boolean increased = false;
            
            for (int j = 0; j < current.size(); j++) {
                if (!current.get(j).isSurprising()){
                    max++;
                    increased = true;
                    break;
                }
            }
            
            if (!increased && !current.isEmpty() && currentSur < maxSur){
                max++;
                currentSur++;
            }
        }

        return max;
    }

    private LinkedList<Combination> dancerPossibleCombs(int total, int p) {

        LinkedList<Combination> list = new LinkedList<Combination>();

        // Get all possible combs
        for (int i = 0; i <= 10; i++) {

            if ((i + 2) >= p && (3 * i) + 4 >= total) { // otherwise no possible/useful combination

                // 8 possible combs
                if (3 * i == total && i >= p) {
                    Combination c = new Combination(
                            new int[]{i, i, i}, false);
                    list.add(c);
                    continue;
                }
                if ((3 * i + 1) == total && (i + 1) >= p) {
                    Combination c = new Combination(
                            new int[]{i, i, i + 1}, false);
                    list.add(c);
                    continue;
                }

                if ((3 * i + 2) == total) {
                    if (i + 2 >= p) {
                        Combination c1 = new Combination(
                                new int[]{i, i, i + 2}, true);
                        list.add(c1);
                    }
                    if (i + 1 >= p) {
                        Combination c2 = new Combination(
                                new int[]{i, i + 1, i + 1}, false);

                        list.add(c2);
                    }

                    continue;
                }

                if (3 * i + 3 == total && (i + 2) >= p) {
                    Combination c = new Combination(
                            new int[]{i, i + 1, i + 2}, true);
                    list.add(c);
                    continue;
                }

                if (3 * i + 4 == total && (i + 2) >= p) {
                    Combination c1 = new Combination(
                            new int[]{i, i + 2, i + 2}, true);
                    list.add(c1);
                }
            }
        }

        return list;

    }
}
