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.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;


public class DancingWithTheGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		int T = -1;
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		System.out.println("Input");
		try {
			T = Integer.valueOf(br.readLine()).intValue();
		} catch (NumberFormatException e) {
			System.out.println("Plz input the Numbers.");
			e.printStackTrace();
		} catch (IOException e) {
			System.out.println("Application will be terminated.");
			e.printStackTrace();
		}
		
		if (T < 1 || T > 100) {
			System.out.println("Input value should be larger than 0, also smaller than 100.");
			return ;
		}
		
		ArrayList<Info> info = new ArrayList<Info>();
		
		String s = null;
		
		int fromIndex = 0, toIndex = -1;
		
		for (int i = 0; i < T; i++) {
			Info temp = new Info();
			try {
				s = br.readLine();
//				System.out.println("s : " + s);
				toIndex = s.indexOf(" ", fromIndex);

				temp.N = Integer.parseInt(s.substring(fromIndex, toIndex));
				if (temp.N < 1 || temp.N > 101) {
					System.out.println("N value should be larger than 0, also smaller than 101.");
					return ;
				}
				temp.points = new int[temp.N];
				
				fromIndex = toIndex + 1;
				toIndex = s.indexOf(" ", fromIndex);
				temp.S = Integer.parseInt(s.substring(fromIndex, toIndex));
				if (temp.S < 0 || temp.S > temp.N) {
					System.out.println("S value should be larger than -1, also smaller than N.");
					return ;
				}
				
				fromIndex = toIndex + 1;
				toIndex = s.indexOf(" ", fromIndex);
				temp.P = Integer.parseInt(s.substring(fromIndex, toIndex));
				if (temp.P < 0 || temp.P > 10) {
					System.out.println("P value should be larger than -1, also smaller than 11.");
					return ;
				}
				
				for (int j = 0; j < temp.N; j++) {
					fromIndex = toIndex + 1;
					toIndex = s.indexOf(" ", fromIndex);
					
					if (toIndex == -1)
						temp.points[j] = Integer.parseInt(s.substring(fromIndex));
					else
						temp.points[j] = Integer.parseInt(s.substring(fromIndex, toIndex));
					
					if (temp.points[j] < 0 || temp.points[j] > 30) {
						System.out.println("points value should be larger than -1, also smaller than 31.");
						return ;
					}
				}
//				int swap;
//				for (int j = 0; j + 1 < temp.N; j++) {
//					if (temp.points[j] > temp.points[j+1]) {
//						swap = temp.points[j + 1];
//						temp.points[j + 1] = temp.points[j];
//						temp.points[j] = swap;
//					}
//				}

				fromIndex = 0;

			} catch (IOException e) {
				System.out.println("Application will be terminated.");
				e.printStackTrace();
			}
//			System.out.println("temp.N : " + String.valueOf(temp.N));
//			System.out.println("temp.S : " + String.valueOf(temp.S));
//			System.out.println("temp.P : " + String.valueOf(temp.P));
//			for (int j = 0; j < temp.N; j++) {
//				System.out.println("temp.points[" + String.valueOf(j) + "] : " + String.valueOf(temp.points[j]));
//			}
			
			info.add(temp);
		}
		System.out.println("Output");
		for (int i = 0; i < info.size(); i++) {
			System.out.print("Case #" + String.valueOf(i + 1) + ": ");
			System.out.println(String.valueOf(overPersonCheck(info.get(i))));
		}
	}
	
	private static int overPersonCheck(Info info) {
		int count = 0;
		int surprisingNum = info.S;

		for (int i = 0; i < info.N; i++) {
			if (info.P == 0) {
				count++;
				continue ;
			} else if (info.points[i] == 0) {
				continue ;
			}
			
			if (info.points[i] >= info.P * 3) {
				count++;
			} else if (info.points[i] >= info.P * 3 - 2) {
				count++;
			} else if (info.points[i] >= info.P * 3 - 4 && surprisingNum > 0) {
				count++;
				surprisingNum--;
			}
		}

		return count;
	}

}

class Info {
	int N;
	int S;
	int P;
	int[] points;
}
