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

import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class Dancing {
    Scanner in;
    PrintWriter out;
    int N;
    int P, S;

    public void solve() throws IOException {
        int tn = in.nextInt();
        in.nextLine();
        for (int test = 1; test <= tn; test++) {
            String line = in.nextLine();
            String[] numbers = line.split(" ");
            N = Integer.parseInt(numbers[0]);
            S = Integer.parseInt(numbers[1]);
            P = Integer.parseInt(numbers[2]);
            int[] x = new int[N];
            for (int i = 0; i < N; i++) {
                x[i] = Integer.parseInt(numbers[3 + i]);
            }
            out.println("Case #" + test + ": " + calculate(x));
        }
    }

    boolean[] moreThanP = new boolean[N];
    boolean[] isSurprising = new boolean[N];
    boolean[] isSurprisingAndMoreThanP = new boolean[N];
    boolean[] seen = new boolean[N];

    private int calculate(int[] x) {
        moreThanP = new boolean[N];
        isSurprising = new boolean[N];
        isSurprisingAndMoreThanP = new boolean[N];
        seen = new boolean[N];
        int res = 0;
        Arrays.sort(x);
        //ArrayUtils.reverse(x);
        for (int i = 0; i < x.length; i++) {
            generate(x, i);
        }

        int i = 0;
        int s = S;
        while (i < N && s > 0) {
            if (isSurprisingAndMoreThanP[i]) {
                s--;
                res++;
                seen[i] = true;
            }
            i++;
        }
        i = 0;
        while (i < N && s > 0) {
           if (!seen[i] && isSurprising[i]) {
               s--;
               seen[i] = true;
           }
            i++;
        }

        i = 0;
        while (i < N) {
            if (!seen[i] && moreThanP[i]) {
                res++;
                seen[i] = true;
            }
            i++;
        }

        return res;
    }

    private void generate(int[] x, int index) {
        for (int a = 10; a >= 0; a--)
            for (int b = 10; b >= 0; b--)
                for (int c = 10; c >= 0; c--) {
                    if (a + b + c == x[index] && isValid(a, b,c)) {
                       if (getMax(a,b,c) >= P) {
                           if (isSurprising(a, b, c)) {
                               isSurprisingAndMoreThanP[index] = true;
                           } else {
                               moreThanP[index] = true;
                           }
                       }
                       else if (isSurprising(a, b, c)) {
                            isSurprising[index] = true;
                       }
                    }
                }
    }


    private boolean isValid(int a, int b, int c) {
        return Math.abs(a - b) <= 2 && Math.abs(b - c) <= 2 && Math.abs(c - a) <= 2;
    }

    private boolean isSurprising(int a, int b, int c) {
        return Math.abs(a - b) == 2 || Math.abs(b - c) == 2 || Math.abs(c - a) == 2;
    }

    private int getMax(int a, int b, int c) {
        return Math.max(Math.max(a, b),c );
    }


    public void run() {
        try {
            in = new Scanner(Googlerese.class.getResourceAsStream("/resources/B-small-attempt0.in"));
            out = new PrintWriter(new File("/tmp/ProblemB.out"));

            solve();

            in.close();
            out.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    public static void main(String[] arg) {
        new Dancing().run();
    }


}
