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 com.kingter;

import java.io.FileReader;
import java.io.LineNumberReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

public class GoogleDancer {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception {
		//read
		List<Integer> resultList = new ArrayList<Integer>();
		
//		LineNumberReader lin = new LineNumberReader(new FileReader("./B-small-attempt0.in"));
		LineNumberReader lin = new LineNumberReader(new FileReader("./B-large.in"));
		
		String line = null;
		while ((line = lin.readLine()) != null) {
			System.out.println("Process #"+lin.getLineNumber()+":"+line);
			if (lin.getLineNumber() == 1) continue;
			String[] testCaseStr = line.split(" ");
			int N = Integer.parseInt(testCaseStr[0]);
			int S = Integer.parseInt(testCaseStr[1]);
			int p = Integer.parseInt(testCaseStr[2]);
			
			List<Integer> tl = new ArrayList<Integer>(testCaseStr.length - 3);
			for (int i = 3; i < testCaseStr.length; i++) {
				tl.add(Integer.parseInt(testCaseStr[i]));
			}
			resultList.add(count(N, S, p, tl));
			
		}
		
		//write
		
//		 PrintWriter out = new PrintWriter("./B-small-attempt0.out");
		 PrintWriter out = new PrintWriter("./B-large.out");
		try{
			int i = 1;
			for (Iterator<Integer> it = resultList.iterator(); it.hasNext();) {
				int count = it.next();
				System.out.println("Case #"+i+": "+count);
				out.println("Case #"+i+": "+count);
				i++;
			}
		} finally {
			out.close();
		}

	}
	public static int count(int N, int S, int p, List<Integer> tl) {
		System.out.print("N="+N+",");
		System.out.print("S="+S+",");
		System.out.println("p="+p+",");
		System.out.println("tl="+tl);
		
		//count
		int count = 0;
		int best = Math.max(S, (p * 3) - 2);
		int supBest = Math.max(S, best -2);
		
		for (Iterator<Integer> it = tl.iterator(); it.hasNext();) {
			int result = it.next();
			if (result >= best) {
				count++;
				continue;
			}
			if (result >= supBest && S >= 1) {
				count++;
				S--;
			}
		}
		System.out.println("count="+count);
		
		return count;
	}

}
