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.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class B {
	public void solve( Scanner sc, PrintWriter pw ) {
		int tests = sc.nextInt( ); sc.nextLine( );
		for ( int i = 0 ; i < tests; i++ ) {
			int googlers = sc.nextInt( );
			int suprises = sc.nextInt( );
			int minScore = sc.nextInt( );
			
			int minimumNsFoundIn = (((3*minScore)-2) > 0 ) ? ((3*minScore)-2) : 0;
			int minimumSFoundIn = (((3*minScore)-4) > 0 ) ? ((3*minScore)-4) : 2;
			int out = 0;
			
			int[]scores = new int[googlers];
			for ( int j = 0 ; j < googlers; j++ ) {
				scores[j] = sc.nextInt( );
			}
			Arrays.sort( scores );
			for ( int j = 0 ; j < scores.length; j++ ) {
				int score = scores[j];
				if ( score >= minimumNsFoundIn ) {
					out++;
				} else if ( suprises > 0 && score >= minimumSFoundIn ) {
					out++;
					suprises--;
				}
			}
			pw.println( "Case #" + (i+1) + ": " + out );
			pw.flush( );
		}
	}

	public static void main ( String[] args ) throws IOException {
		Scanner sc = new Scanner(new FileReader("B-small-attempt0.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("B-small-attempt0.out"));
		new B( ).solve( sc, pw );
		pw.close( );
		sc.close( );
	}

//	public final static HashMap<Integer, String> NON_SUPRISING = new HashMap<Integer, String>( );
//	public final static HashMap<Integer, String> SUPRISING = new HashMap<Integer, String>( );
//	static {
//		//target = ( 3k-2 > 0 ) ? 3k-2 : 0;
//		//0 = 
//		//0 = 0
//		//1 = 1
//		//2 = 4
//		//3 = 7
//		//4 = 10
//		//5 = 13
//		//6 = 16
//		//7 = 19
//		//8 = 22
//		//9 = 25
//		//10 = 28
//		NON_SUPRISING.put( 0, "0 0 0" );
//		NON_SUPRISING.put( 1, "0 0 1" );
//		NON_SUPRISING.put( 2, "0 1 1" );
//		NON_SUPRISING.put( 3, "1 1 1" );
//		NON_SUPRISING.put( 4, "1 1 2" );
//		NON_SUPRISING.put( 5, "1 2 2" );
//		NON_SUPRISING.put( 6, "2 2 2" );
//		NON_SUPRISING.put( 7, "2 2 3" );
//		NON_SUPRISING.put( 8, "2 3 3" );
//		NON_SUPRISING.put( 9, "3 3 3" );
//		NON_SUPRISING.put( 10, "3 3 4" );
//		NON_SUPRISING.put( 11, "3 4 4" );
//		NON_SUPRISING.put( 12, "4 4 4" );
//		NON_SUPRISING.put( 13, "4 4 5" );
//		NON_SUPRISING.put( 14, "4 5 5" );
//		NON_SUPRISING.put( 15, "5 5 5" );
//		NON_SUPRISING.put( 16, "5 5 6" );
//		NON_SUPRISING.put( 17, "5 6 6" );
//		NON_SUPRISING.put( 18, "6 6 6" );
//		NON_SUPRISING.put( 19, "6 6 7" );
//		NON_SUPRISING.put( 20, "6 7 7" );
//		NON_SUPRISING.put( 21, "7 7 7" );
//		NON_SUPRISING.put( 22, "7 7 8" );
//		NON_SUPRISING.put( 23, "7 8 8" );
//		NON_SUPRISING.put( 24, "8 8 8" );
//		NON_SUPRISING.put( 25, "8 8 9" );
//		NON_SUPRISING.put( 26, "8 9 9" );
//		NON_SUPRISING.put( 27, "9 9 9" );
//		NON_SUPRISING.put( 28, "9 9 10" );
//		NON_SUPRISING.put( 29, "9 10 10" );
//		NON_SUPRISING.put( 30, "10 10 10" );
//		
//		//target = 
//		//target = (3k - 4) > 0 ? 3k - 4 : 2
//		//0 = 2
//		//1 = 2
//		//2 = 2
//		//3 = 5
//		//4 = 8
//		//5 = 11
//		//6 = 14
//		//7 = 17
//		//8 = 20
//		//9 = 23
//		//10 = 26
//		SUPRISING.put( 2, "0 0 2" );
//		SUPRISING.put( 3, "0 1 2" );
//		SUPRISING.put( 4, "0 2 2" );
//		SUPRISING.put( 5, "1 1 3" );
//		SUPRISING.put( 6, "1 2 3" );
//		SUPRISING.put( 7, "1 3 3" );
//		SUPRISING.put( 8, "2 2 4" );
//		SUPRISING.put( 9, "2 3 4" );
//		SUPRISING.put( 10, "2 4 4" );
//		SUPRISING.put( 11, "3 3 5" );
//		SUPRISING.put( 12, "3 4 5" );
//		SUPRISING.put( 13, "3 5 5" );
//		SUPRISING.put( 14, "4 4 6" );
//		SUPRISING.put( 15, "4 5 6" );
//		SUPRISING.put( 16, "4 6 6" );
//		SUPRISING.put( 17, "5 5 7" );
//		SUPRISING.put( 18, "5 6 7" );
//		SUPRISING.put( 19, "5 7 7" );
//		SUPRISING.put( 20, "6 6 8" );
//		SUPRISING.put( 21, "6 7 8" );
//		SUPRISING.put( 22, "6 8 8" );
//		SUPRISING.put( 23, "7 7 9" );
//		SUPRISING.put( 24, "7 8 9" );
//		SUPRISING.put( 25, "7 9 9" );
//		SUPRISING.put( 26, "8 8 10" );
//		SUPRISING.put( 27, "8 9 10" );
//		SUPRISING.put( 28, "8 10 10" );
//	}
}