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.IOException;
import java.io.PrintWriter;
import java.nio.charset.Charset;
import java.nio.file.Files;
import java.nio.file.Paths;
import java.util.List;

/* run with JDK7 */
public class DancingWithTheGooglers {

    public static void main(String[] args) throws IOException {
        List<String> input = Files.readAllLines(Paths.get("K:/B-large.in"), Charset.defaultCharset());
        PrintWriter output = new PrintWriter("K:/B-large.out");
        int testCount = Integer.parseInt(input.get(0));
        for (int i = 1; i <= testCount; ++i) {
            String[] parts = input.get(i).split(" ");
            int n = Integer.parseInt(parts[0]);
            int s = Integer.parseInt(parts[1]);
            int p = Integer.parseInt(parts[2]);
            int[] t = new int[n];
            for (int j = 0; j < n; ++j)
                t[j] = Integer.parseInt(parts[3 + j]);
            // solution
            int alwaysCount = 0, surpriseCount = 0;
            for (int j=0; j<n; ++j) {
                switch (findResult(t[j], p)) {
                    case ALWAYS: ++alwaysCount; break;
                    case SURPRISE: ++surpriseCount; break;
                }
            }
            output.printf("Case #%d: %d\n", i, alwaysCount + Math.min(s, surpriseCount));
        }
        output.close();
    }

    private static Result findResult(int t, int p) {
        int base = t / 3;
        int rem = t - base * 3;
        Result r = null;
        switch (rem) {
            case 0:
                r = tryResult(t, p, base, base, base);
                if (r == null) r = tryResult(t, p, base - 1, base, base + 1);
                break;
            case 1:
                r = tryResult(t, p, base, base, base + 1);
                if (r == null) r = tryResult(t, p, base - 1, base + 1, base + 1);
                break;
            case 2:
                r = tryResult(t, p, base, base + 1, base + 1);
                if (r == null) r = tryResult(t, p, base, base, base + 2);
                break;
            default:
                assert false;
        }
        return r != null ? r : Result.NEVER;
    }

    private static Result tryResult(int t, int p, int a, int b, int c) {
        assert a + b + c == t;
        assert a <= b && b <= c;
        if (a < 0)
            return null;
        if (c >= p) {
            return c - a == 2 ? Result.SURPRISE : Result.ALWAYS;
        }
        return null;
    }

    public enum Result {
        ALWAYS,
        SURPRISE,
        NEVER,
    }
}
