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.*;
import java.util.*;

public class Run
{

	private static class GooglerRating {
		int total;
		int r1, r2, r3;
		int r1s, r2s, r3s;
		
		public GooglerRating ( int totalRating ) {
			total = totalRating;
			
			int mod = totalRating % 3;
			switch ( mod )
			{
				case 0 :
					r3 = r2 = r1 = totalRating / 3;
					r1s = r1 - 1;
					r2s = r2;
					r3s = r3 + 1;
					break;
				case 1 :
					r3 = r2 = r1 = totalRating / 3;
					r3++;
					r1s = r1 - 1;
					r2s = r2 + 1;
					r3s = r3;
					break;
				case 2 :
					r3 = r2 = r1 = totalRating / 3;
					r1++;
					r2++;
					r1s = r1-1;
					r2s = r2-1;
					r3s = r3+2;
				default:
					break;
			}
			
			if ( totalRating == 0 )
			{
				r3s = r2s = r1s = r3 = r2 = r1 = 0;
			}
			if ( totalRating == 1 )
			{
				r3s = r2s = r1s = r3 = r2 = r1 = 0;
				r3s = r3 = 1;
			}
		}
		
		public int bestResult ( ) {
			return Math.max ( r1, Math.max ( r2, r3 ) );
		}
		public int bestSurpriseResult ( ) {
			return Math.max ( r1s, Math.max ( r2s, r3s ) );
		}
		
		public String toString () {
			return "[(" + r1 + ", " + r2 + ", " + r3 + "), " + "(" + r1s + ", " + r2s + ", " + r3s + ")*]";
		}
	}
	
	private static class ProblemInstance {
		int numGooglers;
		int numSurprises;
		int possibleBestResult;
		
		List <GooglerRating> ratings;
		
		public static ProblemInstance from ( String testCase ) {
			ProblemInstance p = new ProblemInstance ();
			
			String[] tokens = testCase.split("\\s+");
			
			p.numGooglers = Integer.parseInt ( tokens[0] );
			p.numSurprises= Integer.parseInt ( tokens[1] );
			p.possibleBestResult = Integer.parseInt ( tokens[2] );
			
			p.ratings = new ArrayList < GooglerRating > ( p.numGooglers );
			
			for ( int googlerIndex = 0; googlerIndex < p.numGooglers; googlerIndex++ ) {
				p.ratings.add ( new GooglerRating ( Integer.parseInt ( tokens[3 + googlerIndex] ) ) );
			}
			
			return p;
		}
		
		public String toString () {
			return "Find the number of ratings that have the best result >= " + possibleBestResult + " with " + numSurprises + " surprises\n\tRatings = " + ratings.toString();
		}
	}
	
	private static String readFile ( String[] args ) {
		StringBuilder text = new StringBuilder();
		try {
			Scanner scanner = new Scanner(new File ( args[0] ));
			while (scanner.hasNextLine())
			{
				text.append(scanner.nextLine() + '\n');
			}
		}
		catch ( Exception e )
		{
			
		}
		finally
		{
		}
		return text.toString();
	}
	
	private static void p ( Object o ) {
		System.out.println ( o );
	}
	public static void main(String[] args) {
		String fileText = readFile ( args );
		Scanner s = new Scanner ( fileText );
		int numTests = Integer.parseInt(s.nextLine ());
		
		for (int testIndex = 1; testIndex <= numTests; testIndex++) {
			String testCase = s.nextLine();
			ProblemInstance p = ProblemInstance.from ( testCase );
			// p ( p.toString() );
			
			List < GooglerRating > allRatings = new ArrayList < GooglerRating > ( p.ratings );
			
			// Find ones that work without surprise			
			int bestWithoutSurprise = 0;
			for ( int i = allRatings.size() - 1; i >= 0; i-- )
			{
				GooglerRating rating = allRatings.get(i);
				if ( rating.bestResult() >= p.possibleBestResult )
				{
					bestWithoutSurprise++;
					allRatings.remove ( i );
				}
			}
			
			// find number of ones that work with surprise
			int bestWithSurprise = 0;
			for ( GooglerRating rating : allRatings )
			{
				if ( rating.bestSurpriseResult () >= p.possibleBestResult )
					bestWithSurprise++;				
			}
			
			int totalPassing = bestWithoutSurprise + Math.min ( bestWithSurprise, p.numSurprises );
			p ( "Case #" + testIndex + ": " + totalPassing );
		}
	}
}