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 Combinations
{
	/*
	 * Since for a given number 0 - 30,
	 * MAXIMUM only 2 valid set (distinct combinations) 
	 * of 3 integers (0 - 10)
	 * which add up to give the number as sum
	 * are available,
	 * We consider two such set for all the numbers from 0-30
	 */
	
	int countPopultatedSet;
	
	int s[][] = {{0,0,0},{0,0,0}};
	Surprising surprising[] = new Surprising [2];
	
	int bestResult[] = {1000 , 1000};	//1000 represents default value
										//Index 0 => for Surprising Result
										//Index 1 => for Non Surprising Result
	
	Combinations()
	{
		countPopultatedSet = 0;
		surprising[0] = new Surprising();
		surprising[1] = new Surprising();
	}
	
	boolean ignore(int x , int y , int z , int whichSurprising)
	{
		int d1 = x - y;
		int d2 = y - z;
		int d3 = z - x;
		
		if(d1 >= -2 && d1 <= 2)
		{
			if(d2 >= -2 && d2 <= 2)
			{
				if(d3 >= -2 && d3 <= 2)
				{
					if(d3 == -2 || d3 == 2 || d2 == -2 || d2 == 2 || d1 == -2 || d1 == 2)
					{
						
						surprising[whichSurprising].isSurprising = 'Y';
					}
					else
					{
						surprising[whichSurprising].isSurprising = 'N';
					}
					return false;
				}
			}
		}
		
		return true;
	}
	
	void populateSets(int x , int y , int z)
	{		
		switch(countPopultatedSet)
		{
			case 0:
				if(!(ignore(x, y, z, 0)))
				{
					s[0][0] = x;
					s[0][1] = y;
					s[0][2] = z;
					
					int tempIndex;
					
					if(surprising[0].isSurprising == 'Y')
					{
						tempIndex = 0;
					}
					else
					{
						tempIndex = 1;
					}
					
					bestResult[tempIndex] = (x > y) ? ((x > z) ? x : z) :((y>z) ? y : z);
					
					countPopultatedSet++;
				}
				break;
				
			case 1:
				if(!(ignore(x, y, z, 1)))
				{
					if(
							!(
									(x == s[0][0] && (y == s[0][1] || y == s[0][2])) ||
									(x == s[0][1] && (y == s[0][2] || y == s[0][0])) ||
									(x == s[0][2] && (y == s[0][0] || y == s[0][1]))
							)
						)
					{
						//Condition to Avoid repeat while adding
						s[1][0] = x;
						s[1][1] = y;
						s[1][2] = z;
						
						int tempIndex;
						
						if(surprising[1].isSurprising == 'N')
						{
							tempIndex = 1;
						}
						else
						{
							tempIndex = 0;
						}
						
						bestResult[tempIndex] = (x > y) ? ((x > z) ? x : z) :((y>z) ? y : z);
												
						countPopultatedSet++;
					}
				}
				break;
		}
	}	
	
	void displayCombinations(int x)
	{
		System.out.println(x + "a => ");
		
		System.out.println(s[0][0] + "," + s[0][1] + "," + s[0][2] + " : " + surprising[0].isSurprising + " Best = " + ((surprising[0].isSurprising) == 'Y' ? bestResult[0] : bestResult[1]));
		
		if(countPopultatedSet == 2)
		{
			System.out.println(s[1][0] + "," + s[1][1] + "," + s[1][2] + " : " + surprising[1].isSurprising + " Best = " + ((surprising[1].isSurprising) == 'Y' ? bestResult[0] : bestResult[1]));
		}
	}
}