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

/**
 * 
 */
package org.mikeyin;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;

/**
 * @author yincrash
 *
 */
public class DancingWithGooglers
{

  /**
   * @param args
   */
  public static void main(String[] args)
  {

    try
    {
      Scanner file = new Scanner(new File(args[0]));
      int testCases = file.nextInt();
      file.nextLine();
      int currentCase = 1;
      final PrintStream ps = new PrintStream(new File("dancers.out"));
      while (currentCase <= testCases) {
        final int numGooglers = file.nextInt();
        final int numSurprises = file.nextInt();
        final int atLeastScore = file.nextInt();
        
        ArrayList<Integer> totalScores = new ArrayList<Integer>(numGooglers);
        
        for (int i = 0; i < numGooglers; i++) {
          totalScores.add(file.nextInt());
        }
        
        ps.append("Case #").print(currentCase);
        ps.append(": ");

        ps.println(getMaxPossibleWithAtLeastScore(totalScores, numSurprises, atLeastScore));
        
        currentCase++;
      }
    } catch (FileNotFoundException e)
    {
      e.printStackTrace();
    }
  }

  private static int getMaxPossibleWithAtLeastScore(
      ArrayList<Integer> totalScores, int numSurprises, int atLeastScore)
  {
    int maxPossible = 0;
    for (int score : totalScores) {
      int mean = score / 3;
      int remainder = score % 3;
      
      switch (remainder) {
        case 2:
          if (mean + 1 >= atLeastScore) {
            maxPossible++;
          }
          else if (numSurprises > 0 && mean + 2 >= atLeastScore) {
            numSurprises--;
            maxPossible++;
          }
          break;
        case 1:
          if (mean + 1 >= atLeastScore) {
            maxPossible++;
          }
          break;
        case 0:
          if (mean >= atLeastScore)
            maxPossible++;
          else if (numSurprises > 0 && mean != 0 && mean + 1 >= atLeastScore) {
            numSurprises--;
            maxPossible++;
          }
          break;
      }
    }
    
    return maxPossible;
  }

}
