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;
	}
	
	
}

package Qualification.A.jam2011;

import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

/*

 4
 3 1 5 15 13 11
 3 0 8 23 22 21
 2 1 1 8 0
 6 2 8 29 20 8 18 18 21


 */
public class C {
	static int S;
	static int p;
	static int min;

	public static void main(String[] args) throws IOException {

		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		File f = new File("output.txt");
		FileWriter fw = new FileWriter(f);
		in.nextLine();

		for (int j = 0; j < T; j++) {

			S = in.nextInt();
			p = in.nextInt();
			min = in.nextInt();

			String s = in.nextLine();
			// System.out.println(S+"\n"+p+"\n"+min);
			s = s.substring(1);
			// System.out.println(s);

			fw.write("Case #" + (j + 1) + ": " + passed(s) + "\n");
			// System.out.println("Case #" + (j + 1) + ": " + passed(s) + "\n");
		}

		fw.flush();
		fw.close();

	}

	private static int passed(String s) {
		String[] v = s.split(" ");
		// int[] intv=new int[v.length];
		int total = 0;
		for (int i = 0; i < v.length; i++) {
			// intv[i]=Integer.parseInt(v[i]);
			total += calc(Integer.parseInt(v[i]));
		}

		return total;
	}

	private static int calc(int parseInt) {
		int base = parseInt / 3;
		switch (parseInt % 3) {
		case 0: {
			if (base >= min) {
				return 1;
			} else {
				if (p > 0 && base > 0 && base + 1 >= min) {
					p--;
					return 1;
				}
			}

			break;
		}
		case 1: {
			if (base >= min || base + 1 >= min) {
				return 1;
			} else {
				if (p > 0 && base > 0 && base + 1 >= min) {
					p--;
					return 1;
				}
			}

			break;
		}
		case 2: {
			if (base + 1 >= min || base >= min) {
				return 1;
			} else {
				if (p > 0 && base > 0 && base + 2 >= min) {
					p--;
					return 1;
				}
			}

			break;
		}
		}

		/*
		 * if(parseInt<min) return 0; //System.out.println(parseInt); if (base
		 * >= min) { return 1; } if (base == min - 1) { if (parseInt % 3 != 0) {
		 * return 1; } } if (p > 0) { if (base >= min - 2) { if (parseInt % 3 >=
		 * 0) { p = p - 1; return 1; }
		 * 
		 * } if (base == min - 1) { if (parseInt % 3 == 0) { p = p - 1; return
		 * 1; }
		 * 
		 * }
		 * 
		 * }
		 */
		return 0;
	}
}