package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

package codejam;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class ProblemB_DancingWithTheGooglers {
	public static void main(String[] args) throws IOException 
	{
		Scanner scan = new Scanner(new File("c:/B-large.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("Googlers.out")));
		
		
		int N = Integer.valueOf(scan.nextLine());
		int id =1;
		while(scan.hasNextLine())
		{
			String letters = scan.nextLine();
			String[] letter = letters.split(" ");
			
			int peopleNum =  Integer.valueOf(letter[0]);
			int superiNum =  Integer.valueOf(letter[1]);
			int score =  Integer.valueOf(letter[2]);
			int[] scores = new int[peopleNum];
			for(int i=0;i<peopleNum;i++)
			{
				scores[i] = Integer.valueOf(letter[i+3]);
			}
			
			int reslut   = algorithm(peopleNum, superiNum, score, scores);
			out.println("Case #" + id + ": " + reslut);
			
			
			out.println();
			id++;
		}
		out.close();

	}
	
	public static int algorithm(int peopleNum, int superiNum, int score,int[] scores)
	{
		int num = 0;
		int highScores = score * 3 - 2;
		int lowScores  = score * 3 - 4;
		
		//the case score=1
		if(lowScores <= 0) lowScores = 1;
		
		for(int item : scores)
		{
			if(item >= highScores)
				num ++;
			else
			{
				if(superiNum > 0)
				{
					if(item >= lowScores)
					{
						num++;
						superiNum --;
					}
				}
			}
		}

		return num;
	}

}
