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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;


/**
 * 
 * Google Code Jam 2012 Qualification Round - Problem B. Dancing With the Googlers
 * 
 * @author matlock
 *
 */
public class DancingGooglers {

	public static void main(String[] args) {
		DancingGooglers g = new DancingGooglers();
		g.goGo();
	}
	
	public void goGo() {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		try {
			int testCases = Integer.parseInt(in.readLine());
			
			for (int i = 1; i <= testCases; i++) {
				String inputText = in.readLine();
				String[] valueParse = inputText.split(" ");
				int index = 0;
				int numGooglers = Integer.valueOf(valueParse[index++]);
				int numSurprising = Integer.valueOf(valueParse[index++]);
				int targetVal = Integer.valueOf(valueParse[index++]);
				List<Integer> scores = new ArrayList<Integer>();
				
				for (int k = 0; k < numGooglers; k++) {
					scores.add(Integer.valueOf(valueParse[index++]));
				}
				
				int result = runTestCase(scores, numSurprising, targetVal);
				
				System.out.println("Case #" + i + ": " + result);
			}
		} catch (IOException e) {
			System.out.println("Exception: " + e.getMessage());
		}
	}
	
	private int runTestCase(List<Integer> scoreList, int numSurprising, int targetVal) {
		Collections.sort(scoreList);
		int targetCount = 0;
		
		if (targetVal == 0) { // if target score is 0 then all work
			return scoreList.size();
		}
		
		for (int score : scoreList) {
			if ((score - targetVal) / 2 < (targetVal - 2) || (score <= 0)) {
				continue; // skip impossible score
			}
			// process surprising score
			if (((score - targetVal) / 2 >= (targetVal - 2)) && (numSurprising > 0)) {
				targetCount++;
				numSurprising--;
			// all of these scores should be valid, within 1
			} else if ((score - targetVal) / 2 >= (targetVal - 1)) {
				targetCount++;
			} else {
				// skip
			}
		}
		
		return targetCount;
	}
	
}
