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 Main {
	
	Scanner in;
	PrintWriter out;
	
	static final String problemName = "B";
	
	static void asserT(boolean e) {
		if (!e) {
			throw new Error();
		}
	}
	
	
	static class Triple {
		int a;
		int b;
		int c;
		
		int max;
		int min;
		
		Triple(int a, int b, int c) {
			this.a = a;
			this.b = b;
			this.c = c;
			
			max = Math.max(a, Math.max(b, c));
			min = Math.min(a, Math.min(b, c));
			asserT(max - min <= 2);
		}
		
		boolean isSurprising() {
			return max - min == 2;
		}
	}
	
	static class Point {
		ArrayList <Triple> list = new ArrayList<Triple>();
		int sMax = -1;
		int uMax = -1;
						
		void add(int a, int b, int c) {
			list.add(new Triple(a, b, c));
		}
		
		int getSurpriseMaximum() {
			if (sMax == -1) {
				sMax = 0;
				for (Triple curr : list) {
					if (curr.isSurprising()) {
						sMax = Math.max(curr.max, sMax);
					}
				}
			}
			return sMax;
		}
		
		int getUsualMaximum() {
			if (uMax == -1) {
				uMax = 0;
				for (Triple curr : list) {
					if (!curr.isSurprising()) {
						uMax = Math.max(curr.max, uMax);
					}
				}
			}
			return uMax;
		}
	}
	
	static final int MAX_COUNT = 100;
	static final int MAX_POINTS = 10;
	
	Point p[] = new Point[31];
	
	int res[][];
	int scores[];
	
	int gen(int idx, int remainSurp, int least) {
		if (idx == -1) {
			if (remainSurp == 0) {
				return 0;
			} else {
				return Integer.MIN_VALUE / 10;
			}
		}
		if (res[idx][remainSurp] != -1) {
			return res[idx][remainSurp];
		}
		int ans = 0;
		int score = scores[idx];
		int maxSurp = p[score].getSurpriseMaximum();
		int maxUsual = p[score].getUsualMaximum();
		
		if (remainSurp != 0) {
			if (maxUsual >= least || maxSurp >= least) {
				ans++;
			}
			ans += gen(idx - 1, remainSurp - 1, least);
		} 
		int ans2 = 0;
		if (maxUsual >= least) {
			ans2++;
		}
		ans2 += gen(idx - 1, remainSurp, least);
		
		res[idx][remainSurp] = Math.max(ans, ans2);
		return res[idx][remainSurp];
	}
	
	
	int solveOne() {
		scores = new int[in.nextInt()];
		int nSurprising = in.nextInt();
		int least = in.nextInt();
		for (int i = 0; i < scores.length; i++) {
			scores[i] = in.nextInt();
		}
		
		res = new int[scores.length][nSurprising + 1];
		for (int []ar : res) {
			Arrays.fill(ar, -1);
		}
		
		return gen(scores.length - 1, nSurprising, least);
	}
	
	void solve() {
		for (int i = 0; i < p.length; i++) {
			p [i] = new Point();
		}
		for (int i = 0; i <= 10; i++) {
			for (int j = i; j <= 10; j++) {
				for (int k = j; k <= 10; k++) {
					if (k - i <= 2) {
						int sum = i + j + k;
						p[sum].add(i, j, k);
					}
				}
			}
		}
		
		int nTests = in.nextInt();
		in.nextLine();
		for (int i = 0; i < nTests; i++) {
			out.println("Case #" + (i+1) + ": " + solveOne());
		}
	}
	
	void run() {
		try {
			in = new Scanner(new FileReader("C:/GCJ/" + problemName + ".in"));
			out = new PrintWriter(new FileWriter("C:/GCJ/" + problemName + ".out"));
		} catch (IOException e) {
			in = new Scanner(System.in);
			out = new PrintWriter(System.out);
		//	throw new Error();
		}
		
		try {
			solve();
		} finally {
			out.close();
		}
	}

	public static void main(String[] args) {
		new Main().run();
	}
}