package googlers;

import java.util.Scanner;
import java.util.PriorityQueue;
import java.util.Comparator;
public class Googlers {
	
	public static void main(String[] args) {
		
		int n,s,p,count=0,t;		
		Scanner sin=new Scanner(System.in);
		
		t=Integer.parseInt(sin.nextLine());
		
		
		int result[]=new int[t];
		int j=0;
		
		if(t>=1 && t<=100)
		{
		for (int k = 0; k < t; k++) {
		count=0;	
		
			
        String ip = sin.nextLine();
        
        String[]tokens=ip.split(" ");
		
		
		n=Integer.parseInt(tokens[0]);
		s=Integer.parseInt(tokens[1]);
		p=Integer.parseInt(tokens[2]);
		
		if( (s>=0 && s<=n) && (p>=0 && p<=10) )
		{
		int[] total=new int[n];
		
		
		for (int i = 0; i < n; i++)
        {
            total[i] = Integer.parseInt(tokens[i+3]);
        }
		
		Comparator comparator=new PointComparator();
		PriorityQueue pq=new PriorityQueue<Point>(1, comparator);
		
		for (int i = 0; i < n; i++)
		{
			
			int x=total[i]/3;
			int r=total[i]%3;
			if(x>=p)
				count++;
			else if(x<(p-2))
				continue;
			else
			{
				//System.out.println("enter "+x+" "+(p-2));
				if(p-x==1)
				{
					Point temp=new Point();
					temp.q=x;
					temp.r=r;
					pq.add(temp);
				}
				else  // p-x=2
				{
					if(r==0)
						continue;
					else
					{
						Point temp=new Point();
						temp.q=x;
						temp.r=r;
						pq.add(temp);
					}				
					
				}
					
			}
			//System.out.println("hi "+pq.size());
			
		}
		
		
		
		while(pq.size()!=0)
		{
			Point temp=(Point)pq.remove();
			if(p-temp.q==1 && temp.q!=0)
			{
				if(temp.r>=1)
					count++;
				else
				{
					if(s!=0)
					{
						s--;
						count++;
					}
				}
			}
			else if(p-temp.q==2)
			{
				if(s!=0 && (temp.q+temp.r)>=p)
				{
					s--;
					count++;
				}
			}
			
				
		}
		
		//System.out.println(p);
		
		result[j++]=count;
		
		}
		}
		
		for (int i = 0; i < t; i++) 
		{
			System.out.println("Case #"+(i+1)+": "+result[i]);
		}
		}
		
	}
        
        
		
		/*Point x=new Point();
		x.q=8;
		Point y=new Point();
		y.q=6;
		Point z=new Point();
		z.q=7;
		
		pq.add(x);
		pq.add(y);
		pq.add(z);
		*/
		
		
		
		
	

}

class PointComparator implements Comparator<Point>
{
    @Override
    public int compare(Point x, Point y)
    {
        // Assume neither string is null. Real code should
        // probably be more robust
        if (x.q < y.q)
        {
            return 1;
        }
        if (x.q  > y.q)
        {
            return -1;
        }
        return 0;
    }
}



class Point
{
	int q,r;

	public int getQ() {
		return q;
	}

	public void setQ(int q) {
		this.q = q;
	}

	public int getR() {
		return r;
	}

	public void setR(int r) {
		this.r = r;
	}
	
	
}

import java.io.*;

public class DancingWithGooglers {

	static int caseNumber;
	static int totalCases;
	
	public static void main(String[] args) throws Exception {
		
		caseNumber = 1;

		File fileIn = new File("C:\\GCJ\\DancingWithGooglers\\B-small-attempt0.in");
		FileInputStream fileInputStream = null;
		BufferedInputStream inputStream = null;
		BufferedReader reader = null;
		Writer out;
		
		String newLine = System.getProperty("line.separator");
		
		String fileOutPath = "C:\\GCJ\\DancingWithGooglers\\output.txt";
		File fileOut = new File(fileOutPath);
		if (! fileOut.createNewFile()){
			fileOut.delete();
			fileOut.createNewFile();
		}
		
		out = new OutputStreamWriter(new FileOutputStream(fileOutPath), "US-ASCII");
		
		
		StringBuilder builder = new StringBuilder();

		try {
			fileInputStream = new FileInputStream(fileIn);

			// Here BufferedInputStream is added for fast reading.
			inputStream = new BufferedInputStream(fileInputStream);
			reader = new BufferedReader(new InputStreamReader(inputStream));

			totalCases = Integer.parseInt(reader.readLine());
			while (caseNumber <= totalCases){
				builder.append(handleTestCase(reader));
				builder.append(newLine);
				caseNumber++;
			}
			
			
			// dispose all the resources after using them.
			fileInputStream.close();
			inputStream.close();
			reader.close();

		} catch (Exception e) {
			e.printStackTrace();
		} 
		System.out.print(builder.toString());
		out.write(builder.toString());
		out.close();
	}
	
	public static String handleTestCase(BufferedReader reader) throws IOException{
		String[] splitLine = reader.readLine().split(" ");
		int[] ints = stringArrayToIntArray(splitLine);
		int numScores = ints[0];
		int numSurprises = ints[1];
		int goal = ints[2];
		
		int surprisesLeft = numSurprises;
		int metGoal = 0;
		for(int i = 3; i < ints.length; i++){
			//Base cases
			if(ints[i] == 0) {
				if(goal == 0)
					metGoal++;
			}
			
			else if(ints[i] == 1){
				if(goal == 1)
					metGoal++;
			}
			//Handles if the number is divisible by 3
			//If the average is >= the goal, it is trivially meeting the goal
			//If you allow for a surprise, the max can grow by 1
			else if(ints[i] % 3 == 0){
				if(ints[i] / 3 >= goal)
					metGoal++;
				else if ( ints[i] / 3 == goal - 1){
					if(surprisesLeft > 0) {
						surprisesLeft--;
						metGoal++;
					}
				}
			}
			
			//The value of the maximum doesn't change even with a surprise with ints[i] % 3 ==1
			//So I don't even evaluate it here and worry about deducting available surprises
			else if(ints[i] % 3 == 1){
				if(ints[i] / 3 >= goal-1)
					metGoal++;
			}
			
			//Value of the maximum with % 3 == 2 is one above the average by default
			//Allowing for a surprise allows for it to be one higher
			else if(ints[i] % 3 == 2){ //Unecessary "if" statement kept to remind about the last case
				if(ints[i] / 3 >= goal-1)
					metGoal++;
				else if(ints[i] / 3 == goal - 2){
					if(surprisesLeft > 0) {
						surprisesLeft--;
						metGoal++;
					}
				}
			}
			
		}
		
		if(surprisesLeft > 0)
			System.out.println("Surprises were left: "+surprisesLeft+" on case "+caseNumber);
		return "Case #"+caseNumber+": "+metGoal;
	}
	
	public static int[] stringArrayToIntArray(String[] input){
		int[] ints = new int[input.length];
		for (int i = 0; i < input.length; i++){
			ints[i] = Integer.parseInt(input[i]);
		}
		return ints;
	}
}
