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 google.code.jam;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author Bogatinovi
 */
public class B {
    public static void main(String[] args) {
            Scanner in = new Scanner(System.in);
            int T = in.nextInt();
            int br=0;
            for(int i=1;i<=T;i++){
                int Googlers = in.nextInt();
                int suprising = in.nextInt();
                int p = in.nextInt();
                    for(int j=0;j<Googlers;j++){
                        int res=in.nextInt();
                      if(res>=p){
                        if(p*3<=res){++br;}
                        else if((res-p)>=(2*p-2)){
                            br++;
                        }
                        else if(suprising>0){
                            res-=p;
                            if((2*p-4)<=res){
                                br++;
                                suprising--;
                            }
                        }
                      }
                      }
            System.out.println("Case #"+i+": "+br);
            br=0;
            }
    }
}
