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 com.google.codejam;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;

public class DancingWithGooglers {
	public static void main(String argsp[]) throws NumberFormatException, IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream("/Users/ashwinjain/Desktop/SmsLogger/InterviewStreet/src/com/google/codejam/in2.txt")));
		int cases = Integer.parseInt(br.readLine());
		
		for(int x=0;x<cases;x++){
			String temp[] = br.readLine().split(" ");
			int googlers = Integer.parseInt(temp[0]);
			int suprises = Integer.parseInt(temp[1]);
			int minScore = Integer.parseInt(temp[2]);
			
			int nums[] = new int[googlers];
			for(int i=0;i<googlers;i++) {
				nums[i]=Integer.parseInt(temp[i+3]);
			}
			
			int n[] = new int[googlers];
			int s[] = new int[googlers];
			
			for(int i=0;i<googlers;i++){
				if(nums[i]==0){
					n[i]=0;s[i]=0;
				}else if(nums[i]==1){
					n[i]=1;s[i]=1;
				}else if(nums[i]==2){
					n[i]=1;s[i]=2;
				}else if(nums[i]%3==0){
					n[i]=nums[i]/3;
					s[i]=n[i]+1;
				}else if(nums[i]%3==1){
					n[i]=nums[i]/3+1;
					s[i]=n[i];
				}else if(nums[i]%3==2){
					n[i]=nums[i]/3+1;
					s[i]=n[i]+1;
				}
			}
			int ans=0;
			int tempans = 0;
			for(int i=0;i<googlers;i++){
				if(n[i]>=minScore){
					ans++;
					s[i]=-1;
				}
				if(s[i]>=minScore){
					tempans++;
				}
			}
			
			ans = ans+Math.min(suprises, tempans);
			System.out.println("Case #"+(x+1)+": "+ans);
		}
		
	}
}
