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.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;

//Importing Java.io package classes to perform file management operations

//DANCE OF GOOGLERS

public class DanceOfGooglers
{	
	DanceOfGooglers()
	{
		Combinations combinations[] = new Combinations[31];
		for(int i = 0 ; i < 31 ; i++)
		{
			combinations[i] = new Combinations();
		}
	}

	static void doSort(int G[] , int N)
	{
		for(int i = 0 ; i < (N-1) ; i++)
		{
			int min = i;

			for(int j = (i + 1) ; j < N ; j++)
			{
				if(G[j] < G[min])
				{
					min = j;
				}
			}

			if(min != i)
			{
				int temp = G[min];
				G[min] = G[i];
				G[i] = temp;
			}
		}
	}

	public static void main(String[] args)
	{
		int limit = 30;
		int maxInt = 10;

		//Since there are total 31 Numbers 0-30 (Inclusive)
		Combinations combinations [] = new Combinations[31];

		for(int l = 0 ; l < 31 ; l++)
		{
			combinations[l] = new Combinations();
		}

		for(int sum = 0 ; sum <= limit ; sum++)
		{
			for(int i = 0 ; i <= maxInt ; i++)
			{
				for(int j = 0 ; j <= maxInt ; j++)
				{
					for(int k = 0 ; k <= maxInt ; k++)
					{
						if((i + j + k) > sum)
						{
							break;
						}

						if((i + j + k) == sum)
						{
							combinations[sum].populateSets(i, j, k);
							break;
						}
					}
				}
			}			
		}

		try
		{
			// Open the input file
			FileInputStream fistream = new FileInputStream("B-small-attempt0.in");
			
			// Get the object of DataInputStream
			DataInputStream in = new DataInputStream(fistream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			
			//Create output file
			File file = new File("output.out");
			boolean exist = file.createNewFile();
			
			if (!exist)
			{
				System.out.println("File already exists.");
				System.exit(0);
			}
			
			FileWriter fostream = new FileWriter("output.out");
			BufferedWriter out = new BufferedWriter(fostream);
			
			int counter = 0;		//Counter purpose
			
			//Read File Line By Line
			int totalNumberOfCases = 0;
			while ((strLine = br.readLine()) != null)
			{
				if(counter == 0)
				{
					//Ignore the first Line for Conversion
					totalNumberOfCases = Integer.parseInt(strLine);
					counter++;
					continue;
				}
				
				String[] results = strLine.split(" ");
				
				int N = Integer.parseInt(results[0]);
				int S = Integer.parseInt(results[1]);
				int P = Integer.parseInt(results[2]);
				int G[] = new int[N];
				
				//int suprisesRemaining = 0;
				int maxBestResult = 0;
				
				for (int i = 0 ; i < N ; i++)
				{
					G[i] = Integer.parseInt(results[i+3]);
				}
				
				doSort(G , N);
				
				//System.out.println(combinations[G[0]].bestResult[0] + " " + combinations[G[0]].bestResult[1]);
				
				for(int i = 0 ; i < N ; i++)
				{
					if(combinations[G[i]].bestResult[1] < P)	//Non Surprising 
					{
						if(combinations[G[i]].bestResult[0] < P || combinations[G[i]].bestResult[0] == 1000)	//Surprising
						{
							//Ignore
							continue;
						}
						else
						{
							if(S != 0)
							{
								maxBestResult++;
								S--;
							}
						}
					}
					else
					{
						maxBestResult++;			
					}
				}
				
				// Print the content in the output file
				out.write("Case #" + counter + ": " + maxBestResult);
				
				
				//System.out.println(N + " " + S + " " + P + " " + G[0] + " " + G[1] + " " + G[2]);
				/*
				System.out.println("Displaying Combinations");
				System.out.println("=======================");
				
				for(int i = 0 ; i < 31 ; i++)
				{
					combinations[i].displayCombinations(i);
				}
				*/
				
				if(counter < totalNumberOfCases)
				{
					out.write("\n");
				}
				counter++;
			}

			//Close the input stream
			in.close();

			//Close the output Stream
			out.close();

		}
		catch(Exception e)
		{
			//Catch exception if any
			System.err.println("Error: " + e.getMessage() + " : " + e);
		}
	}
}