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.IOException;
import java.io.InputStreamReader;

class Result {
	public boolean possible;
	public int newSurprises;
	
	public Result(int sur) {
		possible = false;
		newSurprises = sur;
	}
	
	public Result(boolean pos, int sur) {
		possible = pos;
		newSurprises = sur;
	}
}

class Input {
	int numCases;
	int numSurprises;
	int minScore;
	int [] sums;
	
	public Input(String line) {
		String [] arr = line.split(" ");
		numCases = Integer.parseInt(arr[0]);
		sums = new int[numCases];
		
		numSurprises = Integer.parseInt(arr[1]);
		minScore = Integer.parseInt(arr[2]);
		
		int j=3;
		for(int i=0;i<numCases;i++) {
			sums[i] = Integer.parseInt(arr[j]);
			j++;
		}
	}
	
	public Result CheckSatisfaction(int sum, int minScore, int surprises) {
		int quotient = sum/3;
		int rem = sum%3;
		
		if(quotient >= minScore) return new Result(true, surprises);
		
		// doesnt satisfy as is, try to use the remainder
		if(rem > 0) {
			if(quotient+1 >= minScore) return new Result(true, surprises);
			
			// even a 1 doesnt satisfy - we will have to use up surprises if we a bigger remainder
			if(rem == 2 && surprises > 0 && quotient+2 >= minScore)
				return new Result(true, surprises-1);
		} else if(rem == 0 && surprises > 0) {
			// no remainder, and doesnt satisfy, try to readjust
			// readjust for 1 if possible
			if(quotient >= 1 && quotient+1 >= minScore) return new Result(true, surprises-1);
		}
		
		//default
		return new Result(surprises);
	}
	
	public int Solve() {
		int count=0;
		int workingSurprises = numSurprises;
		for(int i=0;i<numCases;i++) {
			Result r = CheckSatisfaction(sums[i], minScore, workingSurprises);
			if(r.possible) {
				workingSurprises = r.newSurprises;
				count++;
			}
		}
		return count;
	}
}

public class Main {
	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		// Setup console
		BufferedReader c = new BufferedReader(new InputStreamReader(System.in));
		
		// Read number of test cases
		int numCases = Integer.parseInt(c.readLine());
		// Input
		Input [] testCases = new Input[numCases];
		for(int i=0;i<numCases;i++) {
			testCases[i] = new Input(c.readLine());
		}
		// Solve
		for(int i=0;i<numCases;i++) {
			int soln = testCases[i].Solve();
			System.out.println("Case #" + (i+1) + ": " + soln);
		}
	}
}

