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


public class Dancing_with_the_Googlers {
	public static void main(String[] args) throws IOException   
	  {  		 
		  FileInputStream fis;
		try {
			fis = new FileInputStream("B-small-attempt0.in");
			InputStreamReader ir = new InputStreamReader(fis);
			BufferedReader br = new BufferedReader(ir);
			String s;int i=0;
			br.readLine();
			while (br.ready()) {
				i++;
				s = br.readLine();
				System.out.print("Case #"+i+": ");
				tran(s);
				System.out.print("\r");
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

		  //tran(a);
	  }   
	  static void tran(String a)
	  {
		  String num="";
		  int count=0;int N=0;int S=0;int P=0;
		  int[] score=new int[100];
		  for(int i=0;i<a.length();i++)
		  {
			  if(Character.isDigit(a.charAt(i))&&i!=a.length()-1)
			  {
				  num=num+a.charAt(i);
			  }
			  else if(count==0)
			  {
				  N=Integer.parseInt(num);
				  num="";
				  count++;
			  }
			  else if(count==1)
			  {
				  S=Integer.parseInt(num);
				  num="";
				  count++;
			  }
			  else if(count==2)
			  {
				  P=Integer.parseInt(num);
				  num="";
				  count++;
			  }
			  else if(i==(a.length()-1))
			  {
				  num=num+a.charAt(i);				  
				  score[count-3]=Integer.parseInt(num);
			  }
			  else
			  {
				  score[count-3]=Integer.parseInt(num);
				  num="";
				  count++;
			  }	
		  }
		  //System.out.print(N+" "+S+" "+P+" ");
		  //for(int i=0;i<N;i++){System.out.print(score[i]+" ");}
		  int ans1=0,ans2=0,fin=0;
		  for(int i=0;i<N;i++)
		  {
			  if(score[i]>=P*3-2&&score[i]>=P){ans1++;}
			  else if(score[i]>=P*3-4&&score[i]>=P){ans2++;}			  
		  }
		  if(ans2<=S){fin=ans2+ans1;}
		  else{fin=S+ans1;}
		  System.out.print(fin);
	  }

}
