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

}
package qualificationround;

import java.io.*;
import java.util.Scanner;

public class ProblemB {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException{
		Scanner sc = new Scanner(new FileReader("B.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B.out"));
		int t = sc.nextInt();
		for (int caseNum = 1; caseNum <= t; caseNum++)
		{
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int count = 0;
			for (int i = 0; i<n; i++)
			{
				int pscore = sc.nextInt();
				int score = getScore(pscore);
				if (score>=p)
					count++;
				else if (p-score == 1 && s>0 && pscore >=2)
				{
					s--;
					count++;
				}
			}
			out.println("Case #"+caseNum+": "+count);
		}
		out.close();
	}
	
	public static int getScore(int num)
	{		
		if (num % 3 == 0)
			return num/3;
		else
			return num/3+1;
	}

}
