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 qualification;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

/**
 *
 * @author anvarik
 */
public class dancers {
    
    public static void main(String[] args) throws FileNotFoundException {
        
        int t,n,s,p,x,i,res,j;
        File input = new File("C:\\Users\\anvarik\\Desktop\\old\\in.txt");
        Scanner sc = new Scanner(input);
        t = sc.nextInt();
        for(i=1;i<=t;i++){
            n = sc.nextInt();
            s = sc.nextInt();
            p = sc.nextInt();
            res=0;
            for(j=0;j<n;j++){
                x = sc.nextInt();
                if(x>=3*p-2)
                    res++;
                else if(s>0&&(x>=3*p-4)&&((x>0)||p==0)){
                    res++;s--;
                }
            }
            System.out.println("Case #" + i + ":"+ " " + res);
        }
    }
    
}
