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.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.StringTokenizer;


public class C {
	public static void main(String[] args) throws IOException {
		BufferedReader br=new BufferedReader(new FileReader("codejamb.in"));
		BufferedWriter brout=new BufferedWriter(new FileWriter("codejamb.out"));
		StringTokenizer sb=new StringTokenizer(br.readLine());
		int t=Integer.parseInt(sb.nextToken());
		int n;
		int p;
		int surprising;
		int[] values;
		for(int l=1;l<=t;l++) {
			sb=new StringTokenizer(br.readLine());
			n=Integer.parseInt(sb.nextToken());
			surprising=Integer.parseInt(sb.nextToken());
			p=Integer.parseInt(sb.nextToken());
			values=new int[n];
			for(int i=0;i<n;i++) {
				values[i]=Integer.parseInt(sb.nextToken());
			}
		   int  resultMax=getAnswer(values,p,surprising,0);
		
			brout.write("Case #"+l+": "+resultMax+"\n");
		}
		brout.close();
		return;
	}
	public static int getAnswer(int[] x,int p,int surprisingleft,int start) {
		if(x.length-start<surprisingleft) {
			return Integer.MIN_VALUE;
		}
		if(start>=x.length && surprisingleft!=0) {
			return Integer.MIN_VALUE;
		}
		if(start==x.length && surprisingleft==0) {
			return 0;
		}
		boolean flag=false;
		if(surprisingleft==0) {
			flag=true;
		}
		int ifsurprising=0;
		int ifnotsurprising=0;
		int k=x[start]%3;
		int num1s=0;
		int num2s=0;
		int num3s=0;
		int num1not=0;
		int num2not=0;
		int num3not=0;
		switch(k) {
		case 0:
			if(x[start]==30 || x[start]==0) {
				num1not=x[start]/3;
				num2not=x[start]/3;
				num3not=x[start]/3;
				num1s=x[start]/3;
				num2s=x[start]/3;
				num3s=x[start]/3;
			} else {
				num1s=x[start]/3-1;
				num2s=x[start]/3;
				num3s=x[start]/3+1;
				num1not=x[start]/3;
				num2not=x[start]/3;
				num3not=x[start]/3;	
			}
			
			break;
		case 1:
			if(x[start]==1) {
				num1s=x[start]/3;
				num2s=x[start]/3;
				num3s=x[start]/3+1;
				num1not=x[start]/3;
				num2not=x[start]/3;
				num3not=x[start]/3+1;
			} else {
				num1s=x[start]/3-1;
				num2s=x[start]/3+1;
				num3s=x[start]/3+1;
				num1not=x[start]/3;
				num2not=x[start]/3;
				num3not=x[start]/3+1;
			}
		
			break;
		case 2:
			num1s=x[start]/3;
			num2s=x[start]/3;
			num3s=x[start]/3+2;
			num1not=x[start]/3;
			num2not=x[start]/3+1;
			num3not=x[start]/3+1;
			break;
		}
		if(num1s>=p) {
			ifsurprising++;
		}
		if(num2s>=p) {
			ifsurprising++;
		}
		if(num3s>=p) {
			ifsurprising++;
		}
		if(num1not>=p) {
			ifnotsurprising++;
		}
		if(num2not>=p) {
			ifnotsurprising++;
		}
		if(num3not>=p) {
			ifnotsurprising++;
		}
		if(flag) {
			if(ifnotsurprising>0)
			return getAnswer(x,p,surprisingleft,start+1)+1;
			else 
				return getAnswer(x,p,surprisingleft,start+1);
		}
		else {
			int acc21=0;
			int acc22=0;
			if(ifsurprising>0) {
				acc21=1;
			}
			if(ifnotsurprising>0) {
				acc22=1;
			}
		    
		if(getAnswer(x,p,surprisingleft-1,start+1)+acc21> getAnswer(x, p, surprisingleft, start+1)+acc22)
			return getAnswer(x,p,surprisingleft-1,start+1)+acc21;
		else 
			return getAnswer(x, p, surprisingleft, start+1)+acc22;
	   }
		
	}
}

