import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * The first line of the input gives the number of test cases, T.
     *  T test cases follow. 
     *  Each test case consists of a single line containing integers separated by single spaces. 
     *  The first integer will be N, the number of Googlers, and the second integer will be S, the number of surprising triplets of scores. 
     *  The third integer will be p, as described above. Next will be N integers ti: the total points of the Googlers. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

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();
	}
	
	
}
