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

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author mohamedmohideenebrahim
 */
public class Codejam {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {

        try {
            Scanner scanner = new Scanner(new File(args[0]));
            int testCaseNum = scanner.nextInt();
            scanner.nextLine();
            for (int i = 0; i < testCaseNum; i++) {
                System.out.println("Case #" + (i + 1) + ": " + getString(scanner.nextLine()));
            }
        } catch (FileNotFoundException ex) {
            Logger.getLogger(Codejam.class.getName()).log(Level.SEVERE, null, ex);
        }



    }

    public static int getString(String input) {
        String[] inputArray = input.split(" ");
        //System.out.println(input);
        int noOfSurprise = Integer.parseInt(inputArray[1]);
        int minMark = Integer.parseInt(inputArray[2]);

        int countedSurprise = 0;
        int countedMinMark = 0;

        for (int i = 3; i < inputArray.length; i++) {
            int mark = Integer.parseInt(inputArray[i]);
            int remainder = mark % 3;
            int quotient = mark / 3;
            
            if(remainder == 0)
            {
                //System.out.println(quotient+","+quotient+","+quotient);
                //System.out.println((quotient-1)+","+quotient+","+(quotient+1));
                if(quotient >= minMark)
                {
                    countedMinMark++;
                    //System.out.println("Matched "+quotient+","+quotient+","+quotient);
                }
                else if(mark > 2 && countedSurprise != noOfSurprise && (quotient+1) >= minMark)
                {
                    //System.out.println("Matched "+(quotient-1)+","+quotient+","+(quotient+1));
                    countedMinMark++;
                    countedSurprise++;
                }
                //System.out.println();
            }
            else if(remainder == 1)
            {
                //System.out.println(quotient+","+quotient+","+(quotient+1));
                if(quotient+1 >= minMark)
                {
                    //System.out.println("Matched "+quotient+","+quotient+","+(quotient+1));
                    countedMinMark++;
                }
                //System.out.println();
            }
            else if(remainder == 2)
            {
                //System.out.println((quotient+1)+","+quotient+","+(quotient+1));
                //System.out.println(quotient+","+quotient+","+(quotient+2));
                if(quotient+1 >= minMark)
                {
                    //System.out.println("Matched "+(quotient+1)+","+quotient+","+(quotient+1));
                    countedMinMark++;
                }
                else if(mark > 2 && countedSurprise != noOfSurprise && (quotient+2) >= minMark)
                {
                    countedMinMark++;
                    countedSurprise++;
                    //System.out.println("Matched "+quotient+","+quotient+","+(quotient+2));
                }
                //System.out.println();
                
            }
            //System.out.println("Mark " + mark + " Quotient " + quotient
             //       + " Counted MinMark " + countedMinMark + " counted surprise " + countedSurprise);
            //System.out.println();
        }
        return countedMinMark;

    }
}
