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.*;

public class G2 {

    public static void main(String[] args) throws Exception {
        BufferedReader in = new BufferedReader(new FileReader("d:\\B-small-attempt0.in"));
        int n = Integer.parseInt(in.readLine());
        int cnt;
        int surprize;
        int min;
        int[] points;
        BufferedWriter out = new BufferedWriter(new FileWriter("d:\\g2o.txt"));
        for (int i = 1; i <= n; i++) {
            String[] s = in.readLine().split(" ");
            cnt = Integer.parseInt(s[0]);
            surprize = Integer.parseInt(s[1]);
            min = Integer.parseInt(s[2]);
            points = new int[cnt];
            for (int j = 0; j < cnt; j++) {
                points[j] = Integer.parseInt(s[3 + j]);
            }
            int answer = solve(cnt, surprize, min, points);
            System.err.println("Case #" + i + ": " + answer);
            out.write("Case #" + i + ": " + answer);
            out.newLine();
        }
        out.close();
    }

    private static int solve(int cnt, int surprize, int min, int[] points) {
        int anywayTotal = 0;
        int surprizingTotal = 0;
        
        int anywayMax = 0;
        int surprizingMax = 0;

        for (int point : points) {
            int whole = (point) / 3;
            int part = point % 3;
            if (point > 0 && part == 0) {
                whole--;
                part = 3;
            }
            anywayMax = surprizingMax = whole;    
            
            switch (part) {
                case 1:
                    anywayMax++;
                    break;
                case 2:
                case 3:
                    anywayMax++;
                    surprizingMax+=2;
                    break;
            }
            if (anywayMax >= min)
                anywayTotal++;
            else if (surprizingMax >= min)
                surprizingTotal++;

        }
        return anywayTotal + Math.min(surprize, surprizingTotal);
    }
}
