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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package com.kaka.codejam.qualification;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;

/**
 *
 * @author Karthik
 */
public class ProblemB {

    public static void main(String[] args) {
       readInput();
    }
     static void readInput() {
          ProblemB problemB = null;
        BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
        try {
            int surprises=0;
            int minBestResult=0;
            int[] points = null;
            int numTests = Integer.parseInt(stdin.readLine());
            for (int i = 0; i < numTests; i++) {
                String input = stdin.readLine();
                String [] inputStr= input.split("\\ ");
                for(int j=0;j<inputStr.length;j++){
                    int num = Integer.parseInt(inputStr[j]);
                    if(j==0){
                        points = new int[num];
                    }else if(j==1){
                        surprises = num;
                    }else if(j==2){
                        minBestResult = num;
                    }else{
                        points[j-3] = num;
                    }
                }
                int result = new ProblemB(surprises, minBestResult, points).calculateMaxUsers();
                System.out.println("Case #"+(1+i)+": "+result);
            }
        } catch (Exception e) {
            System.err.println("Ex in reading input:" + e);
        }
    }
   
    int surprises;
    int minBestResult;
    int[] points;

    public ProblemB(int surprises, int minBestResult, int[] points) {
        this.surprises = surprises;
        this.minBestResult = minBestResult;
        this.points = points;
    }

    int calculateMaxUsers() {
        int maxUserCount = 0;
        Arrays.sort(points);
        for (int totalScore : points) {
            boolean isGreaterThanN = false;
            if (surprises > 0) {
                isGreaterThanN = isGreaterThanN(totalScore, minBestResult, true);
                if (isGreaterThanN) {
                    surprises--;
                }
            } else {
                isGreaterThanN = isGreaterThanN(totalScore, minBestResult, false);
            }
            if (isGreaterThanN) {
                maxUserCount++;
            }
        }
        return maxUserCount;
    }

    boolean isGreaterThanN(int score, int n, boolean isSurprise) {
        boolean isGrtThanN = false;
        if (score == 0 || score == 1) {
        } else if (score == 29 || score == 30) {
            score = 30;
        } else if (isSurprise) {
            score += 4;
        } else {
            score += 2;
        }
        if (Math.floor(score / 3) >= n) {
            isGrtThanN = true;
        }
        return isGrtThanN;
    }
}
