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.*;

public class G2 {

    public static void main(String[] args) throws Exception {
        BufferedReader in = new BufferedReader(new FileReader("d:\\B-small-attempt0.in"));
        int n = Integer.parseInt(in.readLine());
        int cnt;
        int surprize;
        int min;
        int[] points;
        BufferedWriter out = new BufferedWriter(new FileWriter("d:\\g2o.txt"));
        for (int i = 1; i <= n; i++) {
            String[] s = in.readLine().split(" ");
            cnt = Integer.parseInt(s[0]);
            surprize = Integer.parseInt(s[1]);
            min = Integer.parseInt(s[2]);
            points = new int[cnt];
            for (int j = 0; j < cnt; j++) {
                points[j] = Integer.parseInt(s[3 + j]);
            }
            int answer = solve(cnt, surprize, min, points);
            System.err.println("Case #" + i + ": " + answer);
            out.write("Case #" + i + ": " + answer);
            out.newLine();
        }
        out.close();
    }

    private static int solve(int cnt, int surprize, int min, int[] points) {
        int anywayTotal = 0;
        int surprizingTotal = 0;
        
        int anywayMax = 0;
        int surprizingMax = 0;

        for (int point : points) {
            int whole = (point) / 3;
            int part = point % 3;
            if (point > 0 && part == 0) {
                whole--;
                part = 3;
            }
            anywayMax = surprizingMax = whole;    
            
            switch (part) {
                case 1:
                    anywayMax++;
                    break;
                case 2:
                case 3:
                    anywayMax++;
                    surprizingMax+=2;
                    break;
            }
            if (anywayMax >= min)
                anywayTotal++;
            else if (surprizingMax >= min)
                surprizingTotal++;

        }
        return anywayTotal + Math.min(surprize, surprizingTotal);
    }
}
