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

}
import java.lang.*;
import java.util.*;
class dancer{
int count,s,p;
int doneS;
int can;
void Counts(int i1){
                    int thrice=3*p;
					if(i1>=thrice){count++;
								  can++;}
					else{int diff=(thrice-i1);
					    if(diff>4){can++;}
					     else if((diff==1)||(diff==2)){
						                             if(p==1){count++;
													          }
													if(p>=2){count++;
													       can++;}		  
												      }
						 else{
						      if(p>=2){count++;
						       doneS++;
							   }
							   }
                         }
						 
							   }}
//===========================
class p1{
public static void main(String args[]){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
for(int i=0;i<n;i++){
dancer d1=new dancer();
int m=sc.nextInt();
d1.s=sc.nextInt();
d1.p=sc.nextInt();
for(int j=0;j<m;j++){
                      d1.Counts(sc.nextInt());  
   					   }
int sub=0;
if(d1.doneS==d1.s){}
else if(d1.doneS>d1.s){
                      sub=d1.doneS-d1.s;
					  }
else{sub=0;
	}					  
d1.count=d1.count-sub;;

System.out.println("Case #"+(i+1)+": "+d1.count);}
}}	