import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;


public class B {
	static int[][] memo;
	static int[] nums;
	static int p;
	public static void main(String[] args)throws IOException
	{
		Scanner br=new Scanner(new File("B-small-attempt0.in"));
		PrintWriter out=new PrintWriter(new File("b.out"));
		int cases=br.nextInt();
		for(int c=1;c<=cases;c++)
		{
			int n=br.nextInt(),s=br.nextInt();
			p=br.nextInt();
			nums=new int[n];
			for(int i=0;i<n;i++)
				nums[i]=br.nextInt();
			memo=new int[n][s+1];
			for(int[] a:memo)
				Arrays.fill(a,-1);
			out.printf("Case #%d: %d\n",c,go(0,s));
		}
		out.close();
	}
	public static int go(int index,int s)
	{
		if(index>=nums.length)
			return 0;
		if(memo[index][s]!=-1)
			return memo[index][s];
		int best=0;
		for(int i=0;i<=10;i++)
		{
			int max=i;
			for(int j=0;j<=10;j++)
			{	
				if(Math.abs(i-j)>2)
					continue;
				max=Math.max(i,j);
				thisone:
				for(int k=0;k<=10;k++)
				{
					int ret=0;
					if(Math.abs(i-k)>2||Math.abs(j-k)>2)
						continue;
					max=Math.max(max,k);
					int count=0;
					if(Math.abs(i-k)==2)
						count++;
					if(Math.abs(i-j)==2)
						count++;
					if(Math.abs(j-k)==2)
						count++;
					if(i+j+k==nums[index])
					{
						boolean surp=(count>=1);
						if(surp&&s>0)
						{
							if(max>=p)
								ret++;
							ret+=go(index+1,s-1);
						}
						else if(!surp)
						{
							if(max>=p)
								ret++;
							ret+=go(index+1,s);
						}
						best=Math.max(best,ret);
					}
					else if(i+j+k>nums[index])
						break thisone;
				}
			}
		}
		return memo[index][s]=best;
	}
}

import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.util.*;

public class B {
    int[][] allno=new int[31][2];
	Scanner sc;

	void solve(int caseID) {
    	int res=0;
    	int n=sc.nextInt();
    	int s=sc.nextInt();
    	int p=sc.nextInt();
    	int[] nos=new int[n];
    	for(int i=0;i<n;i++)
    	    nos[i] = sc.nextInt();
    	for(int i=0;i<n;i++)
    	{
        	if(allno[nos[i]][0]>=p)
        	  res++;
            else if(s>0 && allno[nos[i]][1]>=p)
            {
                res++;
                s--;
            }
        }
         System.out.println(""+res);
	}

	void run() {
		long time = System.currentTimeMillis();
     	update();
		sc = new Scanner(System.in);
		int caseN = sc.nextInt();
		for (int caseID = 1; caseID <= caseN; caseID++) {
			//double t = (System.currentTimeMillis() - time) * 1e-3;
			//if (!SAMPLE) System.err.printf("%03d/%03d %.3f/%.3f%n", caseID, caseN, t, t / (caseID - 1) * caseN);
			System.out.printf("Case #%d: ", caseID);
			solve(caseID);
			System.out.flush();
		}
	}

	void update()
	{
    	int rem;
    	int no;
        for(int i=1;i<=30;i++)
        {
            rem=i%3;
            no=i/3;
            switch(rem)
            {
                case 0:
                  allno[i][0]=no;
                  allno[i][1]=no+1;
                  break;
                case 1:
                  allno[i][0]=no+1;
                  allno[i][1]=no+1;
                  break;
                case 2:
                  allno[i][0]=no+1;
                  allno[i][1]=no+2;
                  break;
            }
        }
    }

	void debug(Object...os) {
		System.err.println(deepToString(os));
	}

	public static void main(String[] args) {
			try {
				System.setIn(new FileInputStream("B.in"));
				System.setOut(new PrintStream(new FileOutputStream("B.out")));
			} catch (IOException e) {
			}
		new B().run();
	}

}