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.dennis.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class DancingGoogle {

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

		
		BufferedReader fin = new BufferedReader(new FileReader("dancing.in"));
		PrintWriter fout = new PrintWriter(new BufferedWriter(new FileWriter("dancing.out")));

		StringTokenizer stringy;
		
		int times = Integer.parseInt(fin.readLine());
		
		
		for(int x= 0 ; x<times; x++){
			stringy= new StringTokenizer(fin.readLine());
			int numg = Integer.parseInt(stringy.nextToken());
			int surprises = Integer.parseInt(stringy.nextToken());
			int limit  = Integer.parseInt(stringy.nextToken());
			int[] googlers = new int[numg];
			
			for(int a = 0; a<numg; a++){
				googlers[a] = Integer.parseInt(stringy.nextToken());
			}
			
			Arrays.sort(googlers);
			
			int[] less = new int[numg];
			
			
			
			for(int a = 0; a<numg; a++){
				
				if(googlers [a] <= 1){
					if(googlers[a]==1) less[a] = 1;
					if(googlers[a]==0) less[a] = 0;
				}				
				else if(googlers[a]%3 == 0){
					less[a] = googlers[a]/3;  
				}
				else if(googlers[a]%3 == 1){
					less[a] = googlers[a]/3+1;
				}
				else if(googlers[a]%3 == 2){
					less[a] = googlers[a]/3+1;
				}
				
			}

			int[] more = new int[numg];
			for(int a = 0; a<numg; a++){
				
				if(googlers [a] <= 1){
					if(googlers[a]==1) more[a] = 1;
					if(googlers[a]==0) more[a] = 0;
				}				
				else if(googlers[a]%3 == 0){
					more[a] = googlers[a]/3+1;  
				}
				else if(googlers[a]%3 == 1){
					more[a] = googlers[a]/3+1;
				}
				else if(googlers[a]%3 == 2){
					more[a] = googlers[a]/3+2;
				}
				
			}
			
			for(int a= 0 ; a<numg;a++){
				if(surprises==0) break;
				
				if(more[a]!= less[a] && more[a] == limit){
					surprises--;
					less[a] = more[a];
				}
				
				
			}
			
			
			
			
			int count =0;
			for(int c=0; c<numg; c++){
				System.out.println(less[c]);
				if(less[c]>=limit) count++;
			}
			
			fout.println("Case #" + (x+1) + ": " + count);
			
		}
		
		
		
		
		
		fout.close();
		System.exit(0);

	}

}
