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

import java.io.*;

/**
 *
 * @author alexho
 */
public class GDWG {
    
    private static int [] result;
    
    
    private void readInput (String infn) throws FileNotFoundException, IOException {
        String line = null;        
        int testCases = 0;
        BufferedReader bufRdr = null;      
        String delimiter = " ";
        File file = new File(infn);
        bufRdr = new BufferedReader(new FileReader(file));            

        testCases = Integer.valueOf(bufRdr.readLine());        
        GDWG.result = new int [testCases];
        
        int index=0;
                
        while ( (line = bufRdr.readLine()) != null ) {
                        
            String [] temp;            
            temp = line.split(delimiter);            
            this.computeMax(temp, index);            
            index++;

        }
        bufRdr.close();

        
    }
    
    private void output (String outfn) throws IOException {
        PrintWriter out = new PrintWriter(new FileWriter(outfn));
        for (int i=0;i<GDWG.result.length;i++) {
            out.println("Case #"+(i+1)+": "+GDWG.result[i]);

        }
        out.close();        
    }
    
    private void computeMax (String [] tempS, int index) {
        
        int N,S,p, max=0,Nti;
        N = Integer.valueOf(tempS[0]);
        S = Integer.valueOf(tempS[1]);
        p = Integer.valueOf(tempS[2]);
        
        for (int i=3;i<tempS.length;i++) {
            Nti = Integer.valueOf(tempS[i]);
            
            // 1st case
            if (p == 0) {
                max++;
            } else if (p > Nti) {
                // do nothing
            } else if (Nti/3 >= p) {
                max++;                
            } else if (p - Nti/3 <=2 && p - Nti/3 > 0 ) {
                if ( 3*p == Nti) {
                        max++;
                    } else if (3*p+1 == Nti) {
                        max++;
                    } else if (3*p-1 == Nti) {
                        max++;
                    } else if (3*p-2 == Nti) {
                        max++;
                    } else if (3*p+2 == Nti) {
                        max++;
                    } else if (3*p-3 == Nti && S > 0) {
                        S--;
                        max++;
                    } else if (3*p+3 == Nti && S > 0) {
                        S--;
                        max++;
                    } else if (3*p-4 == Nti && S > 0) {
                        S--;
                        max++;
                    } else if (3*p+4 == Nti && S > 0) {
                        S--;
                        max++;
                    }
                
            } else {
                
            }
            
            
                                                                           
        }
        GDWG.result[index]=max;
    }
    
    public GDWG () {
        
    }

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException, IOException {
        
        String infn = args[0];
        String outfn = args[1];
        GDWG gdwg = new GDWG();
        gdwg.readInput(infn);
        gdwg.output(outfn);
        for (int i=0;i<GDWG.result.length;i++) {
            System.out.println(GDWG.result[i]);
        }
        
    }
}
