import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package javaapplication2;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/**
 *
 * @author Mash
 */
public class B {
     public static void main(String[] args) throws IOException{
    Scanner in = new Scanner(new FileReader("C:\\ima\\ans.txt"));
    PrintWriter out=new PrintWriter(new FileWriter("C:\\ima\\input.txt"));
    int T,S,p,N,G[];
    T=in.nextInt();
    for(int i=1;i<=T;i++){
        N=in.nextInt();
        G=new int[N];
        S=in.nextInt();
        p=in.nextInt();
        for(int j=0;j<N;j++)G[j]=in.nextInt();
        Arrays.sort(G);
        if(p>1){
        int q=p*3-2;
        int s=p*3-4;
        int cnt=0;
        int pt=N-1;
        for(int j=N-1;j>=0;j--){
            if(G[j]>=q){cnt++;pt--;}
        }
        while(pt>=0&&G[pt]>=s&&S>0){
            cnt++;pt--;S--;
        }
        System.out.println("Case #"+i+": " +cnt);
    }else if(p==1){
        int m=0;
       for(m=0;m<N;m++){
          if(G[m]>0)break;
       }
       System.out.println("Case #"+i+": " +(N-m));
    }else if(p==0)System.out.println("Case #"+i+": "+N);
         }
    }

}
