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

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class ProblemB {
	
	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception{
		// TODO Auto-generated method stub

		Scanner sc = new Scanner(new File("ProblemB.txt.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter(new File("ProblemB.txt.out")));
		
		int t = sc.nextInt();
		
		for(int i=0;i<t;i++){
			
			int n = sc.nextInt();
			int s= sc.nextInt();
			int p = sc.nextInt();
			
			int count =0;
			
			for(int j=0;j<n;j++){
				int x = sc.nextInt();
				int max, diff=0;
				
				if(x%3==0)max = x / 3;
				else max = x/3 + 1;
				
				if(x%3==1) diff=-1;
				
				if (max >=p) count++;
				else if ((max+1) == p && s>0 && diff!=-1 && max>0){
					s--;
					count++;
				}
					
			}
				
			bw.write("Case #" + (i+1) +": "+ count +"\n");
			System.out.println("Case #" + (i+1) +": "+ count);
			}
		
			bw.close();
			sc.close();
				
			
		}
		
	}


