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.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import java.util.StringTokenizer;


public class ProblemBDancingWithTheGooglers {
	
	private static int lines;
	private static Scanner input;
	private static String [] outputs;
	
	public static void main(String[] args) {
		try {
			input = new Scanner(new FileReader(args[0]));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
			System.exit(-1);
		}
		lines = Integer.parseInt(input.nextLine());
		outputs = new String [lines];
		for(int i = 1; i<=lines; i++)
		{
			int maxVal;
			int num;
			int supriseCase;
			int iAns = 0;
			String ans = "Case #" + i + ": ";
			StringTokenizer str = new StringTokenizer(input.nextLine());
			num = Integer.parseInt(str.nextToken());
			supriseCase = Integer.parseInt(str.nextToken());
			maxVal = Integer.parseInt(str.nextToken());
			for(int j = 0; j<num; j++)
			{
				Triplet t = new Triplet(Integer.parseInt(str.nextToken()));
				if(t.highest()>=maxVal)
				{
					iAns++;
				}
				else if(supriseCase>0 && (t.highest() + 1)>= maxVal && t.highest() != t.sum && t.canBeSuprise())
				{
					supriseCase--;
					iAns++;
				}
				
			}
			ans += iAns;
			outputs[i-1] = ans;
			
		}
		try{
			 
    	    File file =new File("outputB.txt");
 
    	    //if file doesnt exists, then create it
    	    if(!file.exists()){
    		file.createNewFile();
    	    }
 
    	    FileWriter fw = new FileWriter(file.getName());
    	    BufferedWriter bw = new BufferedWriter(fw);
    	    for(int k = 0; k<outputs.length; k++)
    	    {
    	    	bw.write(outputs[k]);
    	    	bw.newLine();
    	    }
    	    bw.close();
    	    
		}catch(IOException e){
    		e.printStackTrace();
    	}

	}
	public static class Triplet {
		public static int sum, x, y, z;
		public Triplet(int i)
		{
			sum = i;
			x = (int) Math.round(((double)sum)/3.0);
			y = (int) Math.round(((double)sum)/3.0);
			z = sum - x - y;
		}
		public static boolean canBeSuprise()
		{
			return ((x==y && x==z) || x>z);
		}
		public static boolean allEqual()
		{
			return (x==y && x==z);
		}
		public static int highest()
		{
			if(x>=y)
			{
				if (x>=z)
				{
					return x;
				}
				else
				{
					return z;
				}
			}
			else
			{
				if(y>=z)
				{
					return y;
				}
				else
				{
					return z;
				}
			}
		}
	}

}
