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.FileInputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.Scanner;

public class Run3 {
	class ll {
		public lln f;
		public lln l;
	}

	class lln {
		public Object v;
		public lln n;
	}

	private static Scanner sc;

	public static int gi() {
		return Integer.parseInt(sc.next());
	}

	public static String gn() {
		return sc.next();
	}

	public static void main(String[] args) throws IOException {
		System.setIn(new FileInputStream("B-large.in"));
		System.setOut(new PrintStream("output.txt"));

		sc = new Scanner(System.in);

		int T = gi();

		for (int z = 0; z < T; z++) {

			int N = gi();
			int S = gi();
			int P = gi();

			int[] ti = new int[N];
			for(int i = 0; i < N; i++) {
				ti[i] = gi();
			}

			int c = 0;
			int[][] sc = new int[N][3];
			//System.out.println("z: " + z);
			//System.out.println("N: " + N);
			//System.out.println("S: " + S);
			//ystem.out.println("P: " + P);
			//System.out.println(/*N + " " + */S + " " + P /*+ ' ' + z + " "*/);

			int temp = 0;
			for(int i = 0; i < N; i++) {
				temp = ti[i];
				for(int j = 2; j >= 0; j--) {
					sc[i][j] = temp/(j+1);
					temp -= temp/(j+1);
				}
				Arrays.sort(sc[i]);
				//System.out.println(ti[i] + "\t" + sc[i][0] + "," + sc[i][1] + ","  + sc[i][2] + "\t" + (sc[i][0] + sc[i][1] + sc[i][2]));
			}

			int c2 = 0;
			boolean incc2;

			for (int i = 0; i < N; i++) {
				incc2 = false;
				if(c2 < S) {
					if(sc[i][2] < P && sc[i][2] + 1 == P) {
						/*if(sc[i][2] - sc[i][0] == 1 && sc[i][2] - sc[i][1] == 0) {
							sc[i][2] += 1;
							sc[i][1] -= 1;
							incc2 = true;
						}
						else */
						if(sc[i][0] > 0 && sc[i][2] - sc[i][0] == 0) {
							sc[i][2] += 1;
							sc[i][0] -= 1;
							incc2 = true;
						}
						else if(sc[i][1] > 0 && sc[i][2] - sc[i][0] == 1 && sc[i][2] - sc[i][1] == 0) {
							sc[i][2] += 1;
							sc[i][1] -= 1;
							incc2 = true;
						}
					}
					if(incc2) {
						c2++;
					}
				}
				if(sc[i][2] >= P) {
					c++;
				}
			}

			System.out.format("Case #%d: %d\r\n", z + 1, c);
		}
	}

}
