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.*;
import java.util.*;





public class CodeJamProblem implements Runnable {

	
	public int getRisultato(int n, int s, int p, int[] points) {
		// n=6 s=2 p=8 29 20 8 18 18 21
		int vincitori = 0;
		int suprise = s;
		//Arrays.sort(points);
		System.out.println("CASE:"+Arrays.toString(points));
		for(int i =0;i<points.length;i++) {
			int base = (int)(points[i] / 3);
			int resto = points[i]%3;
			System.out.print(" Resto: " + resto);
			System.out.println("");
			 switch (resto)
		     {
			 case 0:
				 if (base >=p)
		          {
					 vincitori++;
		          }
		          else
		          {
		            // check for surprise case:
		            if (suprise > 0 && base > 0 &&base + 1 >= p)
		            {     
		            	vincitori++;
		            	suprise--;
		            }            
		          }         
				 break;
			 case 1:
				 if (base >= p || base + 1 >= p)
		          {
		              vincitori++;
		          }
		          else
		          {
		            // surprise case:
		            if (suprise > 0 && base + 1 >= p)
		            {
		            	vincitori++;
		            	suprise--;
		            }
		          }
				 break;
			 case 2:
				 if (base + 1 >= p || base >= p)
		          {
					 vincitori++;
		          }
		          else
		          {
		            if (suprise > 0 && base + 2 >= p)
		            {
		            	System.out.println("Winner");
		              vincitori++;
		              suprise--;
		            }
		          }
				 
				 break;
		     }
		}
		System.out.println("Winner["+p+","+s+"]:"+ vincitori);
		return vincitori;
	}
	
	
	public void solve() throws IOException {
		String test = "small";
		//String test = "large";
		Scanner in = new Scanner(new File("B-small-attempt0.in")).useDelimiter(System.getProperty("line.separator")); 
        PrintWriter out = new PrintWriter(new File("B-small-attempt3.out"));
        
        int lineNum = 0;
        int testNum = 0;
        int totalTests = 0;
        
        /*
        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
        */
        
        int n = 0;
        int s = 0;
        int p = 0;
        int[] points = new int[1];
        /*
        String[] x = ("3 1 5 15 13 11").split(" ");
        for(int i = 0;i<x.length;i++) {
        	if(i==0){
        		n = Integer.parseInt(x[i]);
        	}
        	if(i==1) {
        		s = Integer.parseInt(x[i]);
        	}
        	if(i==2) {
        		p = Integer.parseInt(x[i]);
        	}
        	if(i>2) {
        		if(i==3) points = new int[n];
        		points[i-3] = Integer.parseInt(x[i]);
        	}
        }
        int risultato = getRisultato(n,s,p,points);
        */
        
        while (in.hasNext()) {
        	String currentLine = in.next();
        	if(lineNum ==0 ) {
        		//Do Nothing!
        		totalTests = Integer.parseInt(currentLine);
        		lineNum++;
        		continue;
        	}
        	if(lineNum>0) {
        		String[] x = currentLine.split(" ");
                for(int i = 0;i<x.length;i++) {
                	if(i==0){
                		n = Integer.parseInt(x[i]);
                	}
                	if(i==1) {
                		s = Integer.parseInt(x[i]);
                	}
                	if(i==2) {
                		p = Integer.parseInt(x[i]);
                	}
                	if(i>2) {
                		if(i==3) points = new int[n];
                		points[i-3] = Integer.parseInt(x[i]);
                	}
                }
        		
        		int risultato = getRisultato(n,s,p,points);
        		System.out.println("Case #"+(testNum+1)+": "+ risultato);
        		out.println("Case #"+(testNum+1)+": "+ risultato);
        		testNum++;
        	}
            lineNum++;
        }
        in.close();
        out.close();
        
		
	}
	public void run() {
        try {
            solve();
        } catch (IOException e) {
            System.exit(1);
        }
    }

    public static void main(String[] s) {
        new Thread(new CodeJamProblem()).start();
    }
	
	
	
}
