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.util.*; 
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
//SRM525
public class ggcjblarge {
	static int counter = 0;
	static int dp[][] = new int[100][3];
	
	public static int store(int t, int p){
		int divided = t/3;
		
		int a = divided,b = divided,c = divided;
		int remain = t % 3;
		if(remain == 2){
			a++;
			b++;
		}
		if(remain == 1){
			a++;
		}
		dp[counter][0] = a;
		dp[counter][1] = b;
		dp[counter][2] = c;
		//System.out.println(a);
		//System.out.println(b);
		//System.out.println(c);
		//System.out.println(p);
		counter++;
		if(a >= p || b >= p || c >= p){
			return 1;
		}
		return 0;
	}
	
	public static int check(int N, int s, int p){
		int supply = 0;
		for(int i = 0; i < N; i++){
			if(dp[i][0] < p && s > 0){
				dp[i][0]++;
				dp[i][1]--;
				if(dp[i][0] < p ||dp[i][0] - dp[i][1] > 2 || dp[i][1] < 0){
					continue;
				}
				else{
					supply++;
					s--;
				}
			}
		}
		//System.out.println(supply);
		return supply;
	}
	
	public static void main(String[] args) throws FileNotFoundException { 
		int answer = 0;
		Scanner scan = new Scanner(System.in);
		int max = scan.nextInt();

		
		//int dp[][] = new int[3][3];
		
		for(int i = 1; i <= max; i++){
			int N = scan.nextInt();
			int s = scan.nextInt();
			int p = scan.nextInt();
			for(int j = 1; j <= N; j++){
				int n = scan.nextInt();
				answer = answer + store(n, p);
			}
			int supply = check(N, s, p);
			//System.out.println(supply);
			answer = answer + supply;
			System.out.println("Case #" + i + ": " + answer);
			counter = 0;
			answer = 0;
		}
	} 
	
}
