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.*;
import java.util.*;

public class dancers
{
	public static void main(String[] args)
	{
		ArrayList<HashSet<triple>> list = new ArrayList<HashSet<triple>>();
		for (int i = 0; i <= 30; i++)
		{
			HashSet<triple> temp = new HashSet<triple>();
			list.add(temp);
		}
		for (int i = 0; i <= 10; i++)
			for (int j = 0; j <= 10; j++)
				for (int k = 0; k <= 10; k++)
				{
					if (!((Math.abs(i - j) > 2) || (Math.abs(i - k) > 2) || (Math.abs(j - k) > 2)))
					{
						triple temp = new triple(i, j, k);
						HashSet<triple> temp2 = list.get(temp.total);
						boolean found = false;
						for (triple t : temp2)
						{
							if (t.theset.equals(temp.theset))
							{
								found = true;
								break;
							}
						}
						if (!found) temp2.add(temp);
						list.set(temp.total, temp2);
					}
				}

		/*
		 * //System.out.println(list); for (HashSet<triple> h : list) {
		 * //System.out.println(h.size()); }
		 */

		try
		{
			FileReader fread = new FileReader(new File("B-small-attempt4.in"));
			BufferedReader br = new BufferedReader(fread);
			FileWriter fwrite = new FileWriter(new File("output.txt"));
			PrintWriter pw = new PrintWriter(fwrite);
			int cases = new Integer(br.readLine());
			for (int i = 1; i <= cases; i++)
			{
				String line = br.readLine();
				StringTokenizer st = new StringTokenizer(line);

				int googlers = new Integer(st.nextToken());
				int s = new Integer(st.nextToken());
				int p = new Integer(st.nextToken());

				int[] googlerscores = new int[googlers];

				for (int j = 0; j < googlers; j++)
				{
					googlerscores[j] = new Integer(st.nextToken());
				}

				// for (int a : googlerscores)
				// System.out.println(a);

				int fors[] = new int[googlers];
				int fornos[] = new int[googlers];

				for (int j = 0; j < googlers; j++)
				{
					fors[j] = 0;
					fornos[j] = 0;
				}

				int counts = 0;
				int countnos = 0;
				for (int j = 0; j < googlers; j++)
				{
					HashSet<triple> scores = list.get(googlerscores[j]);
					for (triple s1 : scores)
					{
						// System.out.println(s1);
						if (s1.p >= p)
						{
							if (s1.state == 2)
							{
								fors[j] = s1.p;
								counts++;
								// //System.out.println("counts=" + counts);
							}
							else
							{
								fornos[j] = s1.p;
								countnos++;
								// //System.out.println("countnos=" + countnos);
							}
						}
					}
				}
				// System.out.println("s=" + s);
				for (int d : fors)
				{
					// System.out.print(d + ",");
				}
				// System.out.println();

				for (int d : fornos)
				{
					// System.out.print(d + ",");
				}
				// System.out.println();
				int count = 0;
				
				if ((s == 3) && (counts == 3)) count = 3;
				else if (s == 2)
				{
					if ((googlers == 2) && (counts == 2)) count = 2;
					else if ((googlers == 3) && (counts >= 2))
					{
						int check = 0;
						if (fors[0] > 0 && fors[1] > 0)
						{
							check = 2;
							if (fornos[2] > 0) check = 3;
						}
						// 12

						if (fors[1] > 0 && fors[2] > 0)
						{
							check = Math.max(check, 2);
							if (fornos[0] > 0) check = Math.max(check, 3);
						}

						// 23
						if (fors[0] > 0 && fors[2] > 0)
						{
							check = Math.max(check, 2);
							if (fornos[1] > 0) check = Math.max(check, 3);
						}

						// 13
						count = check;
					}
				}
				else if (s == 1)
				{
					if (counts >= 1)
					{
						if (googlers == 1)
						{
							count = 1;
						}
						else if (googlers == 2)
						{
							if (fors[0] > 0)
							{
								count = 1;
								if (fornos[1] > 0) count = 2;
							}
							if (fors[1] > 0)
							{
								count = Math.max(count, 1);
								if (fornos[0] > 0) count = Math.max(count, 2);
							}
						}
						else if (googlers == 3)
						{
							if (fors[0] > 0)
							{
								int check = 1;
								if (fornos[1] > 0) check++;
								if (fornos[2] > 0) check++;
								count = Math.max(count, check);
							}
							if (fors[1] > 0)
							{
								int check = 1;
								if (fornos[0] > 0) check++;
								if (fornos[2] > 0) check++;
								count = Math.max(count, check);
							}
							if (fors[2] > 0)
							{
								// System.out.println("in here");
								int check = 1;
								if (fornos[0] > 0) check++;
								if (fornos[1] > 0) check++;
								count = Math.max(count, check);
							}

						}
					}
				}
				else
				{
					count = countnos;
				}
				pw.println("Case #" + i + ": " + count);
				// System.out.println("Case #" + i + ": " + count);
			}
			pw.close();
		}
		catch (FileNotFoundException e)
		{
			e.printStackTrace();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}

	}
}
