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


public class Dancing_With_the_Googlers {

	public int solve1(int s, int p, int[] t)
	{
		int ans=0;
		for (int i=0;i<t.length;i++)
		{
			boolean next=false;
			for(int a0=0;a0<=t[i];a0++)
			{
				for(int a1=0;a0+a1<=t[i];a1++)
				{
					int a2=t[i]-a1-a0;
					if(a2<0)
						continue;
					
					if(Math.abs(a0-a1)<=2 && Math.abs(a1-a2)<=2 && Math.abs(a0-a2)<=2)
					if(Math.abs(a0-a1)<2 && Math.abs(a1-a2)<2 && Math.abs(a0-a2)<2)
					{
						if(a0>=p || a1>=p || a2>=p)
						{
							ans++;
							next=true;
							break;
						}
					}

				}
				if(next)
					break;
			}
			if(next)
				continue;
			for(int a0=0;a0<=t[i];a0++)
			{
				for(int a1=0;a0+a1<=t[i];a1++)
				{
					int a2=t[i]-a1-a0;
					if(a2<0)
						continue;
					if(Math.abs(a0-a1)<=2 && Math.abs(a1-a2)<=2 && Math.abs(a0-a2)<=2)
					if((Math.abs(a0-a1)==2 || Math.abs(a1-a2)==2 || Math.abs(a0-a2)==2) && s>0)
					{
						if(a0>=p || a1>=p || a2>=p)
						{
							s--;
							ans++;
							next=true;
							break;
						}
					}
				}
				if(next)
					break;
			}			
		}
		
		return ans;
	}
	
	public int solve(int s, int p, int[] t)
	{
		int whichContainsMoreThanP=0;
		int ans=0;
		for (int i=0;i<t.length;i++)
		{
			if(t[i]==0)
			{
				if(0>=p)
					ans++;
				continue;
			}else if(t[i]==1)
			{
				if(1>=p)
					ans++;
				continue;
			}else if(t[i]==2)
			{
				if(1>=p)
					ans++;
				else if(2>=p && s>0)
				{
					ans++;
					s--;
				}
				continue;
			}
			
			int reminder=t[i]%3;
			int division=t[i]/3;

			switch(reminder)
			{
				case 0:// 1,2 or 0,0
					if(division>=p)
						whichContainsMoreThanP++;
					else
						if(division-1+2>=p && s>0)
						{
							s--;
							ans++;
						}
					break;
				case 1:// 2,2 or 0,1
					if(division+1>=p)
						whichContainsMoreThanP++;
					else
						if(division-1+2>=p && s>0)
						{
							s--;
							ans++;
						}
					break;
				case 2:// 0,2 or 1,1
					if(division+1>=p)
						whichContainsMoreThanP++;
					else
						if(division+2>=p && s>0)
						{
							s--;
							ans++;
						}
					break;
				default:
			}
		}
		return ans+whichContainsMoreThanP;
	}
}
/*
 import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.InputStreamReader;


public class Program {


	public static void main(String[] args) {
		
		try {
			FileWriter fileWriter=new FileWriter("B-small-attempt0.out");
			FileReader fileReader=new FileReader("B-small-attempt0.in");
			BufferedReader in = new BufferedReader(fileReader);

			int T= Integer.parseInt(in.readLine());
			for(int t=1;t<=T;t++)
			{
				String[] tokens= in.readLine().split(" ");
				int N= Integer.parseInt(tokens[0]);
				int[] values=new int[N];
				int S= Integer.parseInt(tokens[1]);
				int p= Integer.parseInt(tokens[2]);
				
				for(int n=0;n<N;n++)
				{
					values[n]= Integer.parseInt(tokens[n+3]);
				}
				
				Dancing_With_the_Googlers d=new Dancing_With_the_Googlers();				
				int result=d.solve(S, p, values);
				fileWriter.write("Case #"+t +": " +result+"\n");
				
			}
			fileWriter.close();
			fileReader.close();	
		} catch (Exception e) {
			System.out.println("Error! Exception: "+e); 
		}
		
		
	}

}

 */