/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

import java.util.Scanner;

public class CodeJam1 {

	
	public static void main(String[] args) 
	{
		Scanner kb=new Scanner(System.in);
		int cases=kb.nextInt();
		for(int i=0;i<cases;i++)
		{
			int countSurprise=0;
			int countBest=0;
			int n=kb.nextInt();
			int values[]=new int[n];
			int surprise=kb.nextInt();
			int p=kb.nextInt();
			for(int j=0;j<n;j++)
			{
				values[j]=kb.nextInt();
			}
			
			int arr[][]=new int[n][3];
			for(int j=0;j<n;j++)
			{
				arr[j][0]=values[j]/3;
				int temp=values[j]-arr[j][0];
				int value1=temp/2;
				int value2=temp-value1;
				if(values[j]!=0)
				{
				if(value1-value2==0)
				{
					if(p-value1==1)
					{
						if(countSurprise<surprise)
						{
							countSurprise++;
							countBest++;
							arr[j][1]=value1--;
							arr[j][2]=value2++;
						}
						else
						{
							arr[j][1]=value1;
							arr[j][2]=value2;
						}
					}
					else if (p-value1==0)
					{
						arr[j][1]=value1;
						arr[j][2]=value2;
						countBest++;
					}
					else if(p-value1>1)
					{
						arr[j][1]=value1;
						arr[j][2]=value2;
					}
					else if(p-value1<0)
					{
						arr[j][1]=value1;
						arr[j][2]=value2;
						countBest++;
					}
				}
				
				else if((value2-value1)==1)
				{
					if(p<=value2)
					{
						arr[j][1]=value1;
						arr[j][2]=value2;
						countBest++;
					}
					else 
					{
						arr[j][1]=value1;
						arr[j][2]=value2;
					}
				}
				}
				else{
					if(p==0)
					{
						countBest++;
					}
				}
			}
			System.out.println("Case #"+(i+1)+": " +countBest);
		}

	}

}
