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 hu.hke.gcj;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.UnsupportedEncodingException;

/**
 * @author katalma
 *
 */
public class DancingWithTheGooglers {

	static DancingWithTheGooglers dwtg = new DancingWithTheGooglers() ;
	/**
	 * @param args
	 */
	public static void main(String[] args) {

		readAndCalculate(args[0], args[1]);
	}

	private static void readAndCalculate(String inputF, String outputF) {
		BufferedReader input = null;
		BufferedWriter output = null;
		try {
			String line = null;
			input =  new BufferedReader(new FileReader(inputF));
			output = new BufferedWriter(new FileWriter(outputF));
			boolean first = true;
			int expectedRows = 0;
			int actualRows = -1;
			while ((( line = input.readLine()) != null) && (actualRows < expectedRows)) {
				System.out.print(actualRows+1);
				System.out.println("----------------------------------------------------");
				if (first) {
					first = false;
					expectedRows = Integer.parseInt(line);
				} else {
					output.write("Case #" +(actualRows+1)+": "+ dwtg.maximumBestResults(line));
					if (actualRows +1 < expectedRows) {
						output.write("\n");
					}
				}
				actualRows++;
			}
			
			input.close();
			output.close();
		} catch (UnsupportedEncodingException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} finally {
		}
		
	}

	private String maximumBestResults(String line) {
		// TODO Auto-generated method stub
		System.out.println(line);
		B actLine = new B(line);
		return actLine.pGooglers();
	}
	
	class B {
		int googlerN;
		int suprs;
		int p;
		Googler[] googlers;
		int pGooglers;
		
		private B() {};
		
		B(String line) {
			String[] tmp = line.split(" ");
			googlerN = Integer.parseInt(tmp[0]);
			suprs = Integer.parseInt(tmp[1]);
			p = Integer.parseInt(tmp[2]);
			googlers = new Googler[googlerN<= tmp.length-3? googlerN : tmp.length-3];
			for (int i = 0; i < googlers.length; i++) {
				googlers[i] = new Googler(Integer.parseInt(tmp[i+3])); 
			}
			pGooglers = 0;
		}

		public String pGooglers() {
			// TODO Auto-generated method stub
			System.out.println("Limit: "+p+" Suprise: "+suprs);
			pGooglers = 0;
			int actSuprs = 0;
			for (int i = 0; i < googlers.length; i++) {
				if (googlers[i].possibleP(p)) {
					System.out.println("Possible: " +googlers[i]);
					pGooglers++;
				} else if (actSuprs< suprs) {
					System.out.println("with suprise?");
					if (googlers[i].possiblePS(p)) {
						System.out.println("Possible with suprise: " +googlers[i]);
						pGooglers++;
						actSuprs++;
					} 
				}
			}
			return Integer.toString(pGooglers);
		}
		
	}

	class Googler {
		int totalCounts;
		int div;
		int mod;
		
		Googler(int i) {
			totalCounts = i;
			div = i/3;
			mod = i%3;
		}

		public boolean possibleP(int p) {
			if (div>=p) {
				return true;
			}
			if ((mod<2 ) &&(div+mod>=p)) {
				return true;
			}
			if ((mod==2 ) && (div+1>=p)&& (totalCounts>1)) {
				return true;
			}
			return false;
		}
		public boolean possiblePS(int p) {
			if (div>=p) {
				return true;
			}
			if (div+mod>=p) {
				return true;
			}
			if ((mod==0 ) && (div+1>=p) && (totalCounts>1)) {
				return true;
			}
			return false;
		}
		public String toString() {
			return "googgler: "+totalCounts+"::"+div+"::"+mod;
		}
	}
}
