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.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

class Test{	
	int output;
	char[] mapping;
	String line;
	int S;
	int P;
	int[] Ti;
	
	public Test(String line){
		Scanner lineReader = new Scanner(line);
		int N = lineReader.nextInt();
		S = lineReader.nextInt();
		P = lineReader.nextInt();
		Ti = new int[N];
		for (int i = 0; i < N; i++){
			Ti[i] = lineReader.nextInt();
		}
	}
	
	public int getOutput(){
		return output;
	}

	public void solve(){
		for (int x: Ti){
			if(P == 0){
				output++;
			}
			else if((x >= P*3 -2  && x > 0)){
				output++;
			}
			else if(x >= P*3 -4 && S > 0  && x > 0 && P > 1){
				output++;
				S--;
			}
		}
	}
	
	public char translate(char c){
		if (c == ' '){
			return c;
		}
		boolean changeCase = false;
		if(c != Character.toLowerCase(c)){
			c = Character.toLowerCase(c);
			changeCase = true;
		}
		char toReturn = mapping[Character.valueOf(c) - Character.valueOf('a')];
		if(changeCase){
			toReturn = Character.toUpperCase(toReturn);
		}
		return toReturn;
	}
	
}

public class ProblemB {
	
	public static void main(String[] args) throws IOException{
		File inputFile = new File("input.txt");
		Scanner scan = new Scanner(inputFile);
		int loopCount = scan.nextInt();
		scan.nextLine();
		FileWriter outputFile = new FileWriter("output.txt");
		for(int i = 1; i <= loopCount; i++){
			Test start = new Test(scan.nextLine());
			start.solve();
			outputFile.write("Case #"+i+": " + start.getOutput());
			if(i < loopCount){
				outputFile.write("\r\n");
			}
		}
		outputFile.close();
	}
}
