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.FileInputStream;
import java.io.InputStreamReader;


public class DancingWithTheGooglers {
	
	public static void main(String[] args) {
		
		try {
		
			//int T = 4;
			//int[][] testcases = new int[T][];
//			testcases[0] = new int[]{3,1,5,15,13,11};
//			testcases[1] = new int[]{3,0,8,23,22,21};
//			testcases[2] = new int[]{2,1,1,8,0};
//			testcases[3] = new int[]{6,2,8,29,20,8,18,18,21};
			
			BufferedReader reader = new BufferedReader(new InputStreamReader(new FileInputStream("B-small-attempt0.in")));
			
			String firstLine = reader.readLine();
			int T = Integer.valueOf(firstLine);
			int[][] testcases = new int[T][];
			
			for(int i = 0; i < T; i++) {
				String[] testcase = reader.readLine().split(" ");				
				int N = Integer.valueOf(testcase[0]);
				testcases[i] = new int[3+N];
				testcases[i][0] = N;
				testcases[i][1] = Integer.valueOf(testcase[1]);
				testcases[i][2] = Integer.valueOf(testcase[2]);
				for(int j = 3; j < N+3; j++) {
					testcases[i][j] = Integer.valueOf(testcase[j]);
				}
				
			}
			
			DancingWithTheGooglers dancing = new DancingWithTheGooglers();
			
			System.out.println("Output");
			
			for(int i = 0; i < T; i++) {
				System.out.printf("Case #%d: ",i+1,testcases[i]);
				int result = dancing.maximum(testcases[i]);
				System.out.printf("%s\n", result);
			}
			
		}
		catch(Exception ex) {
			System.out.println("An error occured:\n");
			ex.printStackTrace();
		}
		
		
	}
	
	public int maximum(int[] input) {
		
		int N = input[0];
		int S = input[1];
		int p = input[2];
		
		int hits = 0;
		
		// create the set of possible triplets without considering the surprising triplet of scores
		for(int i = 0; i < N; i++) {
						
			boolean hit = false;
			int totalpoints = input[3+i];
			
			for(int x = 10; x >= p; x--) {
				
				int r1 = totalpoints - x;
				r1 = r1 - x;
				if(r1 == x || r1 == x-1) {
					hits++;
					hit = true;
					break;
				}
				
				int r2 = totalpoints - x;
				r2 = r2 - (x - 1);
				if(r2 == x || r2 == x-1) {
					hits++;
					hit = true;
					break;
				}
				
				int r3 = totalpoints - (x - 1);
				r3 = r3 - x;
				if(r3 == x || r3 == x-1) {
					hits++;
					hit = true;
					break;
				}
				
			}
			
			if(hit == false && S > 0) {
				for(int x = 10; x >= p && x >= 2; x--) {
										
					int r21 = totalpoints - x;
					r21 = r21 - (x - 2);
					if(r21 == x || r21 == x-1) {
						hits++;
						S--;
						break;
					}
					
					int r22 = totalpoints - x;
					r22 = r22 - (x - 1);
					if(r22 == x || r22 == x-2) {
						hits++;
						S--;
						break;
					}
					
					int r23 = totalpoints - x;
					r23 = r23 - (x - 2);
					if(r23 == x || r23 == x-2) {
						hits++;
						S--;
						break;
					}
					
					int r31 = totalpoints - x;
					r31 = r31 - (x - 2);
					if(r31 == x || r31 == x-1) {
						hits++;
						S--;
						break;
					}
					
					int r32 = totalpoints - x;
					r32 = r32 - (x - 1);
					if(r32 == x || r32 == x-2) {
						hits++;
						S--;
						break;
					}				
				}
			}
		}
		
		return hits;
		
	}

}
