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.*;

public class Main {
    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(new FileReader("B-large.in"));
        PrintWriter out = new PrintWriter(new FileWriter("DancingWithTheGooglers-Large.out"));

        DancingWithTheGooglers solver = new DancingWithTheGooglers();
        int testCases = in.nextInt();
        for (int i = 1; i <= testCases; ++i) {
            solver.solve(i, in, out);
        }

        in.close();
        out.close();
    }
}

class DancingWithTheGooglers {
    int MAX_SCORE = 31;
    int[] bestScoreSurprising = new int[MAX_SCORE];
    int[] bestScoreNotSurprising = new int[MAX_SCORE];

    public DancingWithTheGooglers() {
        Arrays.fill(bestScoreSurprising, -1);
        Arrays.fill(bestScoreNotSurprising, -1);
        for (int i = 0; i <= 10; ++i) {
            for (int j = 0; j <= 10; ++j) {
                for (int k = 0; k <= 10; ++k) {
                    if (Math.abs(i - j) > 2 || Math.abs(j - k) > 2 || Math.abs(k - i) > 2) continue;
                    if (Math.abs(i - j) == 2 || Math.abs(j - k) == 2 || Math.abs(k - i) == 2) {
                        int sum = i + j + k;
                        int score = Math.max(i, Math.max(j, k));
                        bestScoreSurprising[sum] = Math.max(bestScoreSurprising[sum], score);
                    }
                    else {
                        int sum = i + j + k;
                        int score = Math.max(i, Math.max(j, k));
                        bestScoreNotSurprising[sum] = Math.max(bestScoreNotSurprising[sum], score);
                    }
                }
            }
        }
    }

    public void solve(int testNumber, Scanner in, PrintWriter out) {
        int N = in.nextInt();
        int S = in.nextInt();
        int P = in.nextInt();
        int[] t = new int[N];
        for (int i = 0; i < N; ++i)
            t[i] = in.nextInt();

        int res = 0;
        int a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0, z = 0;
        for (int score : t) {
            if (bestScoreSurprising[score] == -1) {
                if (bestScoreNotSurprising[score] >= P) {
                    ++a;
                }
                else {
                    ++c;
                }
            }
            else if (bestScoreNotSurprising[score] == -1) {
                if (bestScoreSurprising[score] >= P) {
                    ++b;
                }
                else {
                    ++d;
                }
            }

            if (bestScoreSurprising[score] >= P) {
                if (bestScoreNotSurprising[score] >= P) {
                    ++h;
                }
                else {
                    ++f;
                }
            }
            else if (0 <= bestScoreSurprising[score] && bestScoreSurprising[score] < P) {
                if (bestScoreNotSurprising[score] >= P) {
                    ++g;
                }
                else {
                    ++e;
                }
            }
        }

        z = Math.min(S, b + d);
        S -= z;
        res += a + b;
        z = Math.min(S, f);
        S -= z;
        res += z;
        z = Math.min(S, e + h);
        S -= z;
        res += g + h - S;

        out.println("Case #" + testNumber + ": " + res);
    }
}
