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.StringTokenizer;
import java.lang.Math;

public class qualifycodejamB{

	public static int surprisePVal(int score){
		if(score < 4){
			if(score == 0){
				return 0;
			}else if(score == 1){
				return 1;
			}else{
				return 2;
			}
		}

		double dscore = (double) score;

		if((dscore % 3) == 1){
			return (int)Math.ceil(dscore/3);
		}
		else{
			return ((int)Math.ceil(dscore/3) + 1);
		}

	}

	public static int bestVal(int score){
		if(score < 4){
			if(score == 0){
				return 0;
			}else{
				return 1;
			}
		}
		double dscore = (double)score;
		return (int)Math.ceil(dscore/3);
	}

	public static int process_score(int cscore, int ttl_surp, int surp, int pval){
		int returnval = 0;
		int currentp = bestVal(cscore);


		if(currentp >= pval){
			return 1;
		}

		int bestp = surprisePVal(cscore);

		if (bestp >= pval && ttl_surp > surp){
			return 3;
		}

		return returnval;
	}

	public static void main(String[] args){

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		   String x = null;
		   String linein = null;
		   int totalcases = 0;
		   int ttl_scores = 0;
		   int ttl_surprises = 0;
		   int surprise_count = 0;
		   int pval = 0;
		   int pcount = 0;
		   int currentscore = 0;
		   int scorecount = 0;
		   int counter = 1;
		   int process_return = 0;

		   try{
		    x = br.readLine();
		    totalcases = Integer.parseInt(x);

		    while( (linein = br.readLine()) != null){
					surprise_count = 0;
					pcount = 0;
					scorecount = 0;

					StringTokenizer st = new StringTokenizer(linein);
					ttl_scores = Integer.parseInt(st.nextToken());
					ttl_surprises = Integer.parseInt(st.nextToken());
					pval = Integer.parseInt(st.nextToken());

					while(scorecount < ttl_scores){
						currentscore = Integer.parseInt(st.nextToken());
						process_return = process_score(currentscore,ttl_surprises,surprise_count,pval);
						if ((process_return & 1) == 1){
							pcount++;
						}
						if (process_return == 3){
							surprise_count++;
						}

						scorecount++;
					}

					System.out.print("Case #" + (counter) + ": "+ pcount);
					//System.out.println(" debug: return val: "+process_return+"; used surprises: " + surprise_count + "/"+ttl_surprises);
					System.out.println();

					counter++;
				}

		   }
		   catch (IOException e) {
			   e.printStackTrace();
		   }

	}

}