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.*;
import java.util.*;

/**
 *
 * @author Hilos
 */
public class ProblemB {

    public static BufferedWriter bw;
    public static BufferedReader br;

    public static void main(String[] args) {
        try {
            String filename = "B-large";
            br = new BufferedReader(new FileReader("E:\\Downloads\\" + filename + ".in"));
            bw = new BufferedWriter(new FileWriter("E:\\Downloads\\" + filename + ".out"));

            int caseCount = Integer.parseInt(br.readLine());

            for (int c = 0; c < caseCount; c++) {
                String[] lineParts = br.readLine().split(" ");

                int N = Integer.parseInt(lineParts[0]);
                int S = Integer.parseInt(lineParts[1]);
                int p = Integer.parseInt(lineParts[2]);

                int[] scores = new int[N];

                for (int s = 0; s < N; s++) {
                    scores[s] = Integer.parseInt(lineParts[3 + s]);
                }

                SolveCase(c + 1, N, S, p, scores);
            }


        } catch (Exception exc) {
            System.out.println(exc.toString());
        }
    }

    public static void SolveCase(int caseNumber, int N, int S, int p, int[] scores) throws Exception {

        int aboveOrEqual = 0;
        int surprisingLeft = S;

        int scoreCount = scores.length;
        for (int s = 0; s < scoreCount; s++) {
            int score = scores[s];

            if(score == 0){
                if(p == 0){
                    aboveOrEqual++;   
                }
            }else  if (score % 3 == 1) {
                if ((score + 2) / 3 >= p) {
                    aboveOrEqual++;
                }
            } else if (score % 3 == 0) {
                if ((score / 3) >= p) {
                    aboveOrEqual++;
                } else if (surprisingLeft > 0 && (score / 3) + 1 >= p) {
                    aboveOrEqual++;
                    surprisingLeft--;
                }
            } else if (score % 3 == 2) {
                if (((score + 1) / 3) >= p) {
                    aboveOrEqual++;
                } else if (surprisingLeft > 0 && ((score + 1) / 3) + 1 >= p) {
                    aboveOrEqual++;
                    surprisingLeft--;
                }
            }
        }

        bw.write("Case #" + caseNumber + ": " + aboveOrEqual + "\n");
        bw.flush();
    }
}
