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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class DancingWithGooglers {


    public static void main(String[] args) throws IOException {
        File in = new File("c:\\temp\\input.txt");
        File out = new File("c:\\temp\\output.txt");
        BufferedWriter w = new BufferedWriter(new FileWriter(out));
        Scanner sc = new Scanner(in);
        int testCases = Utils.readIntegerLine(sc);
        for (int i = 1; i <= testCases; i++) {
            int googlers =  Utils.readInteger(sc);
            int surprising = Utils.readInteger(sc);
            int minBestResult = Utils.readInteger(sc);
            int[] totalPoints = new int[googlers];
            for(int j = 0; j < googlers; j++) {
                totalPoints[j] = Utils.readInteger(sc);
            }
            int maxGooglersWithBestResults = solve(googlers, surprising, minBestResult, totalPoints);
            String result = String.format("Case #%d: %d", i, maxGooglersWithBestResults);
            w.write(result);
            System.err.println(result);
            w.newLine();
        }
        w.close();

    }

    static int minTotalPointsForBestScore(int b, boolean s) {
        switch (b) {
        case 0: return s ? 2 : 0;
        case 1: return s ? 2 : 1;
        default: return s ? Math.max(2, b + b - 2 + b - 2) : b + b - 1 + b - 1;
        }
    }

    static int maxTotalPointsForBestScore(int b, boolean s) {
        return s ? 28 : 30;
    }


    static boolean canBeSurprising(int total) {
        return total >= 2 && total <= 28;
    }


    private static int solve(int googlers, int surprising, int minBestResult,
            int[] totalPoints) {
        int n = googlers;
       // Arrays.sort(totalPoints);

        Set<Integer> canBeSurprising = new HashSet<Integer>();
        Set<Integer> okIfSurprising = new HashSet<Integer>();
        Set<Integer> okIfNotSurprising = new HashSet<Integer>();
        Set<Integer> areSurprising = new HashSet<Integer>();
        int i = 0;
       for (int points : totalPoints) {
           int minPoints = 0;
           int maxPoints = 0;
            if (canBeSurprising(points)) {
                canBeSurprising.add(i);
                // assume surprising
                minPoints = minTotalPointsForBestScore(minBestResult, true);
                maxPoints = maxTotalPointsForBestScore(minBestResult, true);
                if (points >= minPoints && points <= maxPoints) {
                    okIfSurprising.add(i);
                }
            }


            // assume not surprising
            minPoints = minTotalPointsForBestScore(minBestResult, false);
            maxPoints = maxTotalPointsForBestScore(minBestResult, false);
            if (points >= minPoints && points <= maxPoints) {
                okIfNotSurprising.add(i);
            }
            i++;
        }


        int count = 0;
        _outer:

        while (surprising > 0) {
            for(int j = 0; j < googlers; j++) {
                if (canBeSurprising.contains(j)) {
                    if (okIfSurprising.contains(j) && !okIfNotSurprising.contains(j)) {
                        surprising--;
                        areSurprising.add(j);
                        canBeSurprising.remove(j);
                        continue _outer;
                    }
                }
            }
            for(int j = 0; j < googlers; j++) {
                if (canBeSurprising.contains(j)) {
                    if (!okIfSurprising.contains(j) && okIfNotSurprising.contains(j)) {
                        surprising--;
                        areSurprising.add(j);
                        canBeSurprising.remove(j);
                        continue _outer;
                    }
                }
            }
            for(int j = 0; j < googlers; j++) {
                if (canBeSurprising.contains(j)) {
                    if (okIfSurprising.contains(j)) {
                        surprising--;
                        areSurprising.add(j);
                        canBeSurprising.remove(j);
                        continue _outer;
                    }
                }
            }
            for(int j = 0; j < googlers; j++) {
                if (canBeSurprising.contains(j)) {
                        surprising--;
                        areSurprising.add(j);
                        canBeSurprising.remove(j);
                        continue _outer;
                }
            }
        }

        for(int j = 0; j < googlers; j++) {
                if (okIfSurprising.contains(j) && areSurprising.contains(j)) {
                    count++;
                } else
                if (okIfNotSurprising.contains(j) && !areSurprising.contains(j)) {
                    count++;
                }
        }

        return count;
    }

}

