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.File;
import java.io.PrintWriter;
import java.util.Scanner;


public class B {

	int ref;
	
	int[] scores = new int[3];
	
	int max1=0;
	
	int max2=0;
	
		
	public B(int ref, int suma) {
		super();
		this.ref = ref;
		scores[0] = suma/3;
		suma-=scores[0];
		scores[1] = suma/2;
		scores[2] = suma-scores[1];
		max1 = scores[2]>=ref?1:0;	
		if (suma>=2 && suma <= 28)
			max2 = (scores[2]+1)>=ref?1:0;
		else
			max2=-1;
		//System.out.println(Arrays.toString(scores));
		/*if(ref==scores[0])
			max2--;
		if(scores[1]>=ref)
			max2++;
		if((scores[2]+1)>=ref)
			max2++;
		int tmpMax = 0;
		if(ref==scores[0])
			tmpMax--;
		if(scores[1]+1>=ref)
			tmpMax++;
		if((scores[2])>=ref)
			tmpMax++;
		if(tmpMax>max2)
			max2=tmpMax;
			*/		
	}



	public static void main(String[] args) throws Exception{
		Scanner sc = new Scanner(new File("B-large.in"));
		PrintWriter pw = new PrintWriter(new File("B-large.out"));
		int cases = sc.nextInt();
		for (int i = 0; i < cases; i++) {
			int n = sc.nextInt();
			int s = sc.nextInt();
			int ref = sc.nextInt();
			B[] scores = new B[n];
			boolean[] excep = new boolean[n];
			for (int j = 0; j < n; j++) {
				scores[j] = new B(ref,sc.nextInt());
			}
			for (int j = 0; j < s; j++) {
				int max = -10;
				int index = -1;
				for (int k = 0; k < excep.length; k++) {
					if(excep[k])
						continue;
					if(scores[k].max2-scores[k].max1 > max){
						max = scores[k].max2-scores[k].max1;
						index = k;
					}
				}
				excep[index]=true;
			}
			int res=0;
			for (int j = 0; j < excep.length; j++) {
				if(excep[j])
					res+=scores[j].max2;
				else
					res+=scores[j].max1;
			}
			//System.out.println(Arrays.toString(excep));
			pw.println("Case #"+(int)(i+1)+": "+res);
			
		}
		pw.close();
	}
	
	
}
