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

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


public class DancingWithTheGooglers {
	public static void main(String args[]){
		try {
			Scanner scanner = new Scanner(new File("B-small-attempt0.in"));
			int noOfCase = scanner.nextInt();
			scanner.nextLine();
//			System.out.println(noOfCase);
			String [] cases = new String [noOfCase];
			int counter=0;
			while(scanner.hasNextLine()){
				cases[counter] = scanner.nextLine();
//				System.out.println(cases[counter]);
				counter++;
			}
			
			for(int i =0 ;i<noOfCase;i++){
				System.out.println("Case #"+(i+1)+": "+processInt(cases[i]));
			
			}
			
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
	
	private static int processInt(String caseString){
		Scanner processer = new Scanner(caseString);
		int noOfPeople = processer.nextInt();
		int noOfSuprise = processer.nextInt();
		int leastScore = processer.nextInt();
		
		int [] scoreOfPeople = new int [noOfPeople] ;
		int counter=0;
		while(processer.hasNextInt()){
			scoreOfPeople [counter]=processer.nextInt();
//			System.out.print(scoreOfPeople [counter]+" ");
			counter++;
		}
		
		int leastScoreCounter = 0; 
		int superisingCounter = 0; 
		
		for(int i =0; i<noOfPeople;i++){
			int averageScore= scoreOfPeople [i]/3;
			int extraScore = scoreOfPeople [i]%3;
			int diff = (leastScore-averageScore);
//			System.out.println(scoreOfPeople [i]+" "+averageScore+" "+extraScore+" "+diff+" "+superisingCounter+" "+noOfSuprise+" "+leastScoreCounter);
			if (scoreOfPeople[i] > 0) {
				if (extraScore == 0) {
					if (superisingCounter < noOfSuprise) {
						if (diff == 1) {
							leastScoreCounter++;
							superisingCounter++;
						}
					}
					if (diff < 1) {
						leastScoreCounter++;
					} else {

					}

				} else if (extraScore == 1) {

					if (diff <= 1) {
						leastScoreCounter++;
					} else {

					}

				} else {
					// extraScore ==2
					if (superisingCounter < noOfSuprise) {
						if (diff == 2) {
							leastScoreCounter++;
							superisingCounter++;
						}
					}

					if (diff <= 1) {
						leastScoreCounter++;
					}
				}
			} else if (scoreOfPeople[i] == 0) {
				if(diff ==0 ){
					leastScoreCounter++;
				}
			}
		}
		
		
//		System.out.println();
		
		return leastScoreCounter;
	}
}
