package CodeJam.c2012.clasificacion;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

/**
 * Problem
 *
 * You're watching a show where Googlers (employees of Google) dance, and then
 * each dancer is given a triplet of scores by three judges. Each triplet of
 * scores consists of three integer scores from 0 to 10 inclusive. The judges
 * have very similar standards, so it's surprising if a triplet of scores
 * contains two scores that are 2 apart. No triplet of scores contains scores
 * that are more than 2 apart.
 *
 * For example: (8, 8, 8) and (7, 8, 7) are not surprising. (6, 7, 8) and (6, 8,
 * 8) are surprising. (7, 6, 9) will never happen.
 *
 * The total points for a Googler is the sum of the three scores in that
 * Googler's triplet of scores. The best result for a Googler is the maximum of
 * the three scores in that Googler's triplet of scores. Given the total points
 * for each Googler, as well as the number of surprising triplets of scores,
 * what is the maximum number of Googlers that could have had a best result of
 * at least p?
 *
 * For example, suppose there were 6 Googlers, and they had the following total
 * points: 29, 20, 8, 18, 18, 21. You remember that there were 2 surprising
 * triplets of scores, and you want to know how many Googlers could have gotten
 * a best result of 8 or better.
 *
 * With those total points, and knowing that two of the triplets were
 * surprising, the triplets of scores could have been:
 *
 * 10 9 10 6 6 8 (*) 2 3 3 6 6 6 6 6 6 6 7 8 (*)
 *
 * The cases marked with a (*) are the surprising cases. This gives us 3
 * Googlers who got at least one score of 8 or better. There's no series of
 * triplets of scores that would give us a higher number than 3, so the answer
 * is 3.
 *
 * Input
 *
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing integers
 * separated by single spaces. The first integer will be N, the number of
 * Googlers, and the second integer will be S, the number of surprising triplets
 * of scores. The third integer will be p, as described above. Next will be N
 * integers ti: the total points of the Googlers.
 *
 * Output
 *
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1) and y is the maximum number of Googlers who
 * could have had a best result of greater than or equal to p.
 *
 * Limits
 *
 * 1 â¤ T â¤ 100. 0 â¤ S â¤ N. 0 â¤ p â¤ 10. 0 â¤ ti â¤ 30. At least S of the ti values
 * will be between 2 and 28, inclusive.
 *
 * Small dataset
 *
 * 1 â¤ N â¤ 3.
 *
 * Large dataset
 *
 * 1 â¤ N â¤ 100.
 *
 * Sample
 *
 * Input Output 4 Case #1: 3 3 1 5 15 13 11 Case #2: 2 3 0 8 23 22 21 Case #3: 1
 * 2 1 1 8 0 Case #4: 3 6 2 8 29 20 8 18 18 21
 *
 * @author Leandro Baena Torres
 */
public class B {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader br = new BufferedReader(new FileReader("B.in"));
        String linea;
        int numCasos, N, S, p, t[], y, minSurprise, minNoSurprise;

        linea = br.readLine();
        numCasos = Integer.parseInt(linea);
        for (int i = 0; i < numCasos; i++) {
            linea = br.readLine();
            String[] aux = linea.split(" ");
            N = Integer.parseInt(aux[0]);
            S = Integer.parseInt(aux[1]);
            p = Integer.parseInt(aux[2]);
            t = new int[N];
            y = 0;
            minSurprise = p + ((p - 2) >= 0 ? (p - 2) : 0) + ((p - 2) >= 0 ? (p - 2) : 0);
            minNoSurprise = p + ((p - 1) >= 0 ? (p - 1) : 0) + ((p - 1) >= 0 ? (p - 1) : 0);
            for (int j = 0; j < N; j++) {
                t[j] = Integer.parseInt(aux[3 + j]);
                if (t[j] >= minNoSurprise) {
                    y++;
                } else {
                    if (t[j] >= minSurprise) {
                        if (S > 0) {
                            y++;
                            S--;
                        }
                    }
                }
            }

            System.out.println("Case #" + (i + 1) + ": " + y);
        }
    }
}

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.ArrayList;
import java.util.Arrays;
import java.util.List;


public class Dancers {
	
	public static void main(final String[] args) throws IOException {
		if (args.length < 2) {
			System.out.println("Input and output file must be given");
			return;
		}
		
		PrintWriter pw = null;
		try {
			pw = new PrintWriter(new BufferedWriter(new FileWriter(args[1])));
			final List<TestCase> cases = parseInput(args[0]);
			for(final TestCase test : cases) {
				pw.println("Case #" + test.getCaseNum() + ": " + test.solve());
			}
		} finally {
			if(pw != null) {
				pw.close();
			}
		}
	}
	
	private static List<TestCase> parseInput(String filename) throws IOException {
		final List<TestCase> res = new ArrayList<TestCase>();
		BufferedReader br = null;
		try {
			br = new BufferedReader(new FileReader(filename));
			int caseNum = Integer.parseInt(br.readLine());
			for(int i = 0; i < caseNum; ++i) {
				String[] args = br.readLine().split("\\s");
				int n = Integer.parseInt(args[0]);
				int s = Integer.parseInt(args[1]);
				int p = Integer.parseInt(args[2]);
				int [] scores = new int[n];
				for(int j = 0; j < n; ++j) {
					scores[j] = Integer.parseInt(args[3 + j]);
				}
				res.add(new TestCase(i + 1, n, s, p, scores));
			}
		} finally {
			if(br != null) {
				br.close();
			}
		}
		return res;
	}

	private static class TestCase {
		private int caseNum;
		private int numberOfGooglers;
		private int suprisingTriplets;
		private int minBestResult;
		private int[] scores;
		
		public TestCase(int caseNum, int numberOfGooglers,
				int suprisingTriplets, int minBestResult, int[] scores) {
			super();
			this.caseNum = caseNum;
			this.numberOfGooglers = numberOfGooglers;
			this.suprisingTriplets = suprisingTriplets;
			this.minBestResult = minBestResult;
			this.scores = scores;
		}

		public int solve() {
			int res = 0;
			int [] x = new int[suprisingTriplets];
			for(int i = 0; i < suprisingTriplets; ++i) {
				x[i] = i;
			}
			
			while(true) {
				int maxGooglersForPermutation = countMaxGooglersForPermutation(x);
				res = Math.max(res, maxGooglersForPermutation);
				if(!nextPermutation(x)) {
					break;
				}
			}
			return res;
		}

		private boolean nextPermutation(int[] x) {
			int k = -1;
			for(int i = suprisingTriplets - 1; i >= 0; --i) {
				if(x[i] < numberOfGooglers + suprisingTriplets - i) {
					k = i;
					break;
				}
			}
			if(k >= 0) {
				x[k]++;
				for(int i = k + 1; i < suprisingTriplets; ++i) {
					x[i] = x[k] + i - k;
				}
			}
			return k >= 0;
		}

		private int countMaxGooglersForPermutation(int[] arr) {
			List<Integer> x = new ArrayList<Integer>();
			for(int i = 0; i < suprisingTriplets; ++i) {
				x.add(arr[i]);
			}
			int res = 0;
			for(int i = 0; i < numberOfGooglers; ++i) {
				int score = scores[i];
				int maxForGoogler = -1;
				if(x.contains(i)) {
					maxForGoogler = countMaxForSuprising(score);
				} else {
					maxForGoogler = countMaxForNotSuprising(score);
				}
				if(maxForGoogler >= minBestResult) {
					++res;
				}
			}
			return res;
		}

		private int countMaxForNotSuprising(int score) {
			if(score % 3 == 0) {
				return score / 3;
			} else if(score % 3 == 1) {
				return ((score - 1) / 3) + 1;
			} else {
				return ((score - 2) / 3) + 1;
			}
		}

		private int countMaxForSuprising(int score) {
			if(score % 3 == 0) {
				return score == 0 ? -1 : ((score - 3) / 3) + 2;
			} else if(score % 3 == 1) {
				return score == 1 ? -1 : ((score - 4) / 3) + 2;
			} else {
				return ((score - 2) / 3) + 2;
			}
		}

		public int getCaseNum() {
			return caseNum;
		}

	}
}
