package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;


public class DancingWithTheGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try {
			BufferedReader br = new BufferedReader(new FileReader(
					"C:\\bInput.txt"));
			BufferedWriter bw = new BufferedWriter(new FileWriter(
					"C:\\bOutput.txt"));
			String strLine;
			strLine = br.readLine();
			int size = Integer.parseInt(strLine);
			for (int i = 1; i <= size; i++) {
				String[] s = br.readLine().split(" ");
				int N = Integer.parseInt(s[0]);
				int S = Integer.parseInt(s[1]);
				int p = Integer.parseInt(s[2]);
				int[] totals = new int[N];
				for(int j=0;j<N;j++){
					totals[j] = Integer.parseInt(s[3+j]);
				}
				int res = FindMaximumBests(totals,N,S,p);
				bw.write("Case #" + i + ": " + res);
				bw.newLine();
			}
			bw.close();
			br.close();
		} catch (Exception e) {
			System.out.println(e.getMessage());
		}
	}

	private static int FindMaximumBests(int[] totals, int N, int S, int p) {
		int aboveP = 0;
		int potentialAboveP = 0;
		for (int i = 0; i<N; i++){
			if (totals[i]%3==0){
				if(totals[i]/3>=p)
					aboveP++;
				else if (totals[i]/3==(p-1)){
					if (totals[i]/3==0)//special exception when 0 can't get lower...
						continue;
					potentialAboveP++;
				}
			}
			else if (totals[i]%3==2){
				if((totals[i]/3+1)>=p)
					aboveP++;
				else if ((totals[i]/3+1)==(p-1))
					potentialAboveP++;
			}
			else{
				if((totals[i]/3+1)>=p)
					aboveP++;
			}
		}
		return aboveP + Math.min(S, potentialAboveP);
	}
	
	

}
