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

public class DancingGooglers {
	private static final String IN_FILE = "B-large.in";
	private static final String OUT_FILE = "B-large_output.txt";
	
	public static void main(String[] args) {
		try {
			BufferedReader br = new BufferedReader(new FileReader(IN_FILE));
			BufferedWriter bw = new BufferedWriter(new FileWriter(OUT_FILE));
			String line = br.readLine();
			final int T_CASES = Integer.parseInt(line);
			
			for (int t = 1; t <= T_CASES; t++) {
				line = br.readLine();
				String parts[] = line.split(" ");
				final int N = Integer.parseInt(parts[0]);	// number of Googlers
				final int S = Integer.parseInt(parts[1]);	// number of surprising triplets of scores
				final int P = Integer.parseInt(parts[2]);	// best result of at least p
				
				int[] totalPoints = new int[N];
				for (int i = 0; i < N; i++) {
					totalPoints[i] = Integer.parseInt(parts[i + 3]);
				}
				
				int result = processCase(N, S, P, totalPoints);
				bw.write("Case #" + t + ": " + result);
				bw.newLine();
			}
			
			bw.close();
			br.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
	
	private static int processCase(int n, int s, int p, int[] totalPoints) {
		int result = 0;
		
		for (int t : totalPoints) {
			switch (p) {
			case 0:
				result++;
				break;
			case 1:
				if (t >= 1) {
					result++;
				}
				break;
			default:
				// p is between 2 to 10
				if (t >= 3 * p - 2) {
					result++;
				} else if (s > 0 && t >= 3 * p - 4) {
					s--;
					result++;
				}
				break;
			}
		}
		
		return result;
	}
	
}
