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.util.ArrayList;
import java.util.Collections;
public class DWG {
	int findCount(int N,int S,int p,ArrayList<Integer>arr){
		int count = 0;
		Collections.sort(arr);
		int i = 0;
		while( S != 0 && i<arr.size()){
			int val = 0;
			
			val = arr.get(i);			
			if( (val -3)%3 == 0 && (val-3)>=0){
				int q = (val -3 ) / 3;
				if( (q+2) >=p){
					count++;
					arr.set(i, -1);
					S--;
				}
			}
			else if( (val -2)%3 == 0 &&(val-2)>=0){
				int q = (val -2 ) / 3;
				if( (q+2) >=p){
					count++;
					arr.set(i, -1);
					S--;
				}
			}
			else if( (val -4)%3 == 0 && (val -4)>=0){
				int q = (val -4 ) / 3;
				if( (q+2) >=p){
					count++;
					arr.set(i, -1);
					S--;
				}
			}
			i++;
		}
		for(i = 0; i<N;i++){
			int val = arr.get(i);
			if( val >=0){
				if( (val)%3 == 0){
					int q = (val ) / 3;
					if( (q) >=p){
						count++;
						arr.set(i, -1);						
					}
				}
				else if( (val - 2)%3 == 0 && (val - 2)>=0){
					int q = (val -2 ) / 3;
					if( (q+1) >=p){
						count++;
						arr.set(i, -1);
						
					}
				}
				else if( (val-1)%3 == 0 && (val - 1)>=0){
					int q = (val -1 ) / 3;
					if( (q+1) >=p){
						count++;
						arr.set(i, -1);
						
					}
				}
				
			}
		}	
		
		return count;
	}
	public static void main(String []args){
		DWG d = new DWG();
		
		FileRead fr = new FileRead("B-small-attempt1.in");
		FileWrite fw = new FileWrite("B-small-ouput1.txt");
		
		int num = 0;
		
		int t = fr.readNextInt();
		for(int i = 0; i< t ; i++){
			int arr[] = fr.readNextIntArray();
			
			ArrayList<Integer> a = new ArrayList<Integer>();
			int j = 0;
			for(;j<arr[0];j++){
				a.add(arr[j+3]);
			}
			
			num = d.findCount(arr[0], arr[1], arr[2], a);
			fw.writeLine("Case #"+(i+1)+": "+num);
			
		}
		fw.close();
		fr.close();

	}
}
