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.util.*;
import java.io.*;
import java.math.*;
import static java.lang.System.*;
import static java.lang.Math.*;
import static java.lang.Integer.*;

public class B {
	public static void main(String args[]) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		int t = parseInt(br.readLine());
		for(int z=1;z<=t;z++) {
			String ss[] = br.readLine().trim().split("\\s+");
			int T = parseInt(ss[0]);
			int S = parseInt(ss[1]);
			int p = parseInt(ss[2]);
			int[] arr = new int[T];
			for(int i=0;i<T;i++) {
				arr[i] = parseInt(ss[i+3]);
			}
			Arrays.sort(arr);
			int[][] div = new int[T][3];
			for(int i=0;i<T;i++) {
				div[i][0] = arr[i]/3;
				div[i][1] = (arr[i]-div[i][0])/2;
				div[i][2] = arr[i] - div[i][0] - div[i][1];
			}
			while(S-->0) {
				boolean ok = false;
				for(int i=0;i<T;i++) {
					if(div[i][2] < p) {
						switch(arr[i]%3) {
							case 0:
								if(div[i][2] == p-1 && div[i][0] > 0) {
									div[i][2]++;
									div[i][0]--;
									ok = true;
								}
								break;
							case 1:
								break;
							case 2:
								if(div[i][2] == p-1 && div[i][1] > 0) {
									div[i][2]++;
									div[i][1]--;
									ok = true;
								}
								break;
						}
					}
					if(ok) {
						// out.println(Arrays.toString(div[i]));
						break;
					}
				}
				// if(!ok) {
					// for(int i=0;i<T;i++) {
						// if(!isSup(div[i]) && canBeSup(div[i])) {
							// div[i] = sup(div[i]);
							// ok = true;
						// }
						// if(ok) break;
					// }
				// }
			}
			int count = 0;
			for(int i=0;i<T;i++) {
				if(div[i][2] >= p) count++;
				// out.println(div[i][0]+" "+div[i][1]+" "+div[i][2]);
			}
			out.println("Case #"+z+": "+count);
		}
	}
	
	static boolean isSup(int[] div) {
		return (div[2] - div[0] == 2);
	}
	
	static boolean canBeSup(int[] div) {
		return div[0] != 0;
	}	
	
	static int[] sup(int[] div) {
		if(div[0] == div[2]) return new int[]{div[0]-1,div[1],div[2]+1};
		else if(div[1] == div[2]) return new int[]{div[0],div[1]-1,div[2]+1};
		else return new int[]{div[0]-1,div[1]+1,div[2]};
	}
}