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.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;

public class Scores {
	private String fileName; 
	private FileReader file;
	private FileWriter fileOutput;
	private PrintWriter pw;
	private BufferedReader br;
	private int NbGog;
	private int NbSurp;
	private int maxScore;
	private int nbTest;
	private boolean verbose;


	public Scores (String[] args){
	
		try{
			 fileName =(args[0]);
			
			   file = new FileReader(fileName);
			    br = new BufferedReader(file);
			    fileOutput=new FileWriter(fileName+"_sol.txt");
	    		pw = new PrintWriter(fileOutput);
		    	
		   } catch (Exception e) {
			   e.printStackTrace();
		   }
		   nbTest=1;
		   verbose=false;
	}

	
	public int readNum(String line, int startPos, int [] endPos) {
		String s="";
		int i=0;
		while(startPos<line.length() && line.charAt(startPos)!=' ')
		{
			s+=line.charAt(startPos);
			startPos++;
			i++;
		}
		if(endPos!=null)
			endPos[0]=startPos+1;
		return Integer.parseInt(s);
		
	}

	
	public void dealWithFile () throws IOException{
		float gogAvg=0;
		int total=0;
		int pos[]=new int [1];
		String line = br.readLine();
		int nbTests= Integer.parseInt(line);
		if(verbose)
			System.out.println("nbTests: " + nbTests );
		
		for(nbTest=1; nbTest<= nbTests; nbTest++)
		{
			total=0;
			line = br.readLine();
			NbGog=readNum(line, 0,pos);
			NbSurp=readNum(line, pos[0],pos);
			maxScore=readNum(line, pos[0],pos);
				
			if(verbose)
				System.out.print("\nNbGog: " + NbGog + " NbSurp: " +NbSurp +" maxScore: " + maxScore +" -> ");
			
			for(int j=0; j<NbGog;j++)
			
			{			
				int num=readNum(line, pos[0],pos);
				gogAvg=(float)num/(float)3;
				int gobAvgInt=(int) gogAvg;
				
				if(verbose)
					System.out.print( num + "("+ gogAvg+ ")");
				
				if(gobAvgInt+2>=maxScore)
				{
					float gogAvgDec= gogAvg-gobAvgInt;
									
					if(gogAvgDec<0.3 && gobAvgInt>=maxScore)  //NO *
					{
						if(verbose)
							System.out.println("eq.0");
						total++;
					}
					else if( gogAvgDec<0.3 &&  gobAvgInt-1>=0 && gobAvgInt+1<=10&& gobAvgInt+1>=maxScore&& NbSurp>0) // *
					{
						if(verbose)
							System.out.println("eq.0_S");
						total++;
						NbSurp--;						
					}
					else if(gogAvgDec>=0.3 && gogAvgDec<0.6 && gobAvgInt+1<=10  && gobAvgInt+1>=maxScore)
					{
						if(verbose)
							System.out.println("eq.33");
						total++;
					}
					else if(gogAvgDec>=0.6 && gobAvgInt+1>=maxScore && gobAvgInt+1<=10)
					{
						if(verbose)
							System.out.println("eq.66");
						total++;
					}
					else if(gogAvgDec>=0.6 && gobAvgInt+2>=maxScore && gobAvgInt+2<=10 && NbSurp>0)
					{
						if(verbose)
							System.out.println("eq.66_S");
						total++;
						NbSurp--;
						
					}
					else if(verbose)
						
						System.out.println("NO");
			
				}
			}
			//if(verbose)
				 System.out.println("Case #"+nbTest+": " +total);
				 pw.println("Case #"+nbTest+": " +total);
		
		}

	}
	
	public static void main(String[] args) throws IOException  {
				
		if(args.length!=1)
		{
			System.out.println("Usage: java AlphabetSoup.java <instanceFileName>");
			System.exit(0);
		}
		 Scores scores= new  Scores(args);
		 scores.dealWithFile();
		 if(scores.verbose)
			 System.out.println("End");

		 scores.file.close();
		 scores.fileOutput.close();

	}
}