import java.util.*;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        B th = new B();
        for (int i = 0; i < T; i++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] t = new int[n];
            for (int j = 0; j < n; j++) {
                t[j] = sc.nextInt();
            }
            int c = th.getAnswer(s,p,t);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int s, int p, int[] t) {
        int A1 = p + p-1+p-1;
        int A2 = p + p-2+p-2;
        if (A1 < 0)
            A1 = 0;
        if (A2 < 0)
            A2 = 1;
        int remain = s;
        int count = 0;
        int n = t.length;
        for (int i = 0; i < n; i++) {
            if (t[i] >= A1) {
                count++;
            } else if (t[i] < A1 && t[i] >= A2) {
                if (remain > 0) {
                    remain--;
                    count++;
                }
            }
        }
        return count;
    }
}


import java.util.*;
import java.io.*;
public class dancing {

	public static void main(String[] args) throws Exception {
		Scanner sc=new Scanner(new File("input"));
		int size=sc.nextInt();
		int[] gogo=new int[31];
		int[] cap=new int[31];
		for(int x=3;x<31;x++)cap[x]=x-2;
		gogo[0]=0;
		int best=1;
		int c=0;
		for(int x=1;x<31;x++)
		{
			gogo[x]=best;
			c++;
			if(c==3)
			{
				c=0;
				best++;
			}
		}
		//System.out.println(Arrays.toString(gogo));
		
		for(int w=0;w<size;w++)
		{
			int T=sc.nextInt();
			int S=sc.nextInt();
			int p=sc.nextInt();
			int[] arr=new int[T];
			for(int x=0;x<T;x++)arr[x]=sc.nextInt();
			int[] sto=new int[T];
			for(int x=0;x<T;x++)sto[x]=gogo[arr[x]];
			int ans=0;
			for(int x=0;x<T;x++)
			{
				if(sto[x]>=p)ans++;
				else if(S>0)
				{
					boolean pos=arr[x]==0 || (gogo[arr[x]]-1==gogo[arr[x]-1]);
		
					if(sto[x]+1==p && !pos)
					{
						S--;
						ans++;
					}
				}
			}
			System.out.println("Case #"+(w+1)+": "+ans);
			
			
		} 
	}
}
