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 OleGG
 */
public class QualTaskB {
    public static void main(String[] args) throws Throwable {
        StreamTokenizer st = new StreamTokenizer(new BufferedReader(new FileReader("B-large.in.txt")));
        PrintWriter pw = new PrintWriter(new FileWriter("B-large.out.txt"));
        //StreamTokenizer st = new StreamTokenizer(new InputStreamReader(System.in));
        st.nextToken();
        int t = (int)st.nval;

        for (int test = 1; test <= t; ++test) {
            st.nextToken();
            int n = (int)st.nval;
            st.nextToken();
            int s = (int)st.nval;
            st.nextToken();
            int p = (int)st.nval;

            int[] val = new int[n];
            for (int i = 0; i < n; ++i) {
                st.nextToken();
                val[i] = (int)st.nval;
            }

            int[][] dyn = new int[n + 1][s + 1];
            for (int i = 0; i <= n; ++i) {
                Arrays.fill(dyn[i], 0);
            }

            for (int i = 0; i < n; ++i) {
                dyn[i + 1][0] = dyn[i][0];
                if ((val[i] + 2) / 3 >= p) {
                     ++dyn[i + 1][0];
                }

                for (int j = 0; j < s; ++j) {
                    int add = (val[i] + 2) / 3 >= p ? 1 : 0;
                    int addS = Integer.MIN_VALUE;
                    if (val[i] >= 2 && val[i] <= 28) {
                        switch (val[i] % 3) {
                            case 0:
                            case 1:
                                addS = val[i] / 3 + 1 >= p ? 1 : 0;
                                break;
                            case 2:
                                addS = val[i] / 3 + 2 >= p ? 1 : 0;
                                break;
                        }
                    }
                    dyn[i + 1][j + 1] = Math.max(dyn[i][j+1] + add, dyn[i][j] + addS);
                }
            }
            pw.printf("Case #%d: %d\n", test, dyn[n][s]);
        }
        pw.close();
    }
}
