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

/*
 * Patrick Bonnell
 * Google Code Jam 2012
 * Qualification Round
 * Dancing With the Googlers
 */


import java.io.*;
import java.util.*;


public class DancingSolution
{
	String filename;
	Case[] cases;
	
	private class Case
	{
		int s, p;
		int totals[];
		
		public Case(int n, int s, int p)
		{
			totals = new int[n];
			this.s = s;
			this.p = p;
		}
		
		public boolean hasBestResult(int i, boolean canBeSurprising)
		{
			int currentBest = 10;
			int remainder, min, max;
			
			while(currentBest >= p)
			{
				remainder = totals[i] - currentBest;
				
				if(canBeSurprising)
				{
					if((currentBest - 2) > -1) min = currentBest - 2;
					else min = currentBest;
					
					if((currentBest + 2) < 11) max = currentBest + 2;
					else max = currentBest;
				}
				else
				{
					if((currentBest - 1) > -1) min = currentBest - 1;
					else min = currentBest;
					
					if((currentBest + 1) < 11) max = currentBest + 1;
					else max = currentBest;
				}
				
				if(remainder >= (min * 2) && remainder <= (max * 2)) return true;
				
				currentBest--;
			}
			
			return false;
		}
	}
	
	public DancingSolution(String filename) throws FileNotFoundException
	{
		this.filename = filename;
		Scanner sc = new Scanner(new File(filename));
		
		cases = new Case[sc.nextInt()];
		
		for(int i=0; i<cases.length; i++)
		{
			cases[i] = new Case(sc.nextInt(), sc.nextInt(), sc.nextInt());
			
			for(int j=0; j<cases[i].totals.length; j++)
				cases[i].totals[j] = sc.nextInt();
		}
	}
	
	public void solve() throws IOException
	{
		BufferedWriter out = new BufferedWriter(new FileWriter(new File(filename.replace("in", "out"))));
		for(int i=0; i<cases.length; i++)
			out.write("Case #"+(i+1)+": "+solveCase(i)+"\n");
		out.close();
	}
	
	private int solveCase(int n)
	{
		int withBestResult = 0;
		int suprisingResults = 0;
		
		for(int i=0; i<cases[n].totals.length; i++)
		{
			if(cases[n].hasBestResult(i, false))
				withBestResult++;
			else if(suprisingResults < cases[n].s && cases[n].hasBestResult(i, true))
			{
				withBestResult++;
				suprisingResults++;
			}
		}
		
		return withBestResult;
	}
	
	public static void main(String[] args)
	{
		System.out.print("Input file: ");
		try
		{
			DancingSolution sol = new DancingSolution(new Scanner(System.in).nextLine());
			System.out.println("Running...");
			sol.solve();
			System.out.println("Done.");
		}
		catch(IOException e)
		{
			System.err.println(e);
		}
	}
}
