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


public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args)
	{
		try{
			  // Open the file that is the first 
			  // command line parameter
//			  FileInputStream fstream = new FileInputStream("C-small-practice.in");
			  FileInputStream fstream = new FileInputStream("B-small-attempt0 (1).in");
			  // Get the object of DataInputStream
			  DataInputStream in = new DataInputStream(fstream);
			  BufferedReader br = new BufferedReader(new InputStreamReader(in));
			  String strLine;
			  FileWriter foutstream = new FileWriter("output.out");
			  BufferedWriter out = new BufferedWriter(foutstream);
			  System.out.println (br.readLine());
			  int Case = 0;
			  while ((strLine = br.readLine()) != null)   
			  {
				  Case+=1;
				  out.write("Case #" + Case + ": ");
				  System.out.println (strLine);
				  String str[] = strLine.split(" ");
				  int N = Integer.parseInt(str[0]);
				  int S = Integer.parseInt(str[1]);
				  int p = Integer.parseInt(str[2]);
				  int g[] = new int[str.length-3];
				  int y = 0;
				  for (int i = 3;i<str.length;i++)
				  {
				  g[i-3]=Integer.parseInt(str[i]);
				  //System.out.println(g[i-3]);
				  }
				  //Quicksort(g,0,g.length-1);
				  bubbleSort1(g);
				  for (int i=0;i<g.length;i++)
				  {
					  if (S==-1) S=0;
					  System.out.print(g[i] + ", p=" + p + ", S=" + S + " ,y=");
					  if (((g[i]-p)+2>=2*p))
						  y++;
					  else if (g[i]==0) ;
					  else if (((g[i]-p)+4>=2*p))
					  {
						  if (S>0)
						  {
						  y++;
						  S--;
						  }
						  
					  }
					  System.out.println(y);
					  //if (((g[i]-p)+4>=2*p));

				  }
				  out.write(Integer.toString(y));
				  out.newLine();
				  
				  
			  }
			  out.close();
			  //Close the input stream
			  in.close();
			    }catch (Exception e){//Catch exception if any
			  System.err.println("Error: " + e.getMessage() + " " + e.getCause());
			  }
		System.exit(-1);
	}
	
	 public static void swap (int A[], int x, int y)
	   {
	      int temp = A[x];
	      A[x] = A[y];
	      A[y] = temp;
	   }

	   // Reorganizes the given list so all elements less than the first are 
	   // before it and all greater elements are after it.                   
	   public static int partition(int A[], int f, int l)
	   {
	      int pivot = A[f];
	      while (f < l)
	      {
	        // if (A[f] == pivot || A[l] == pivot) 
	         {
	           // System.out.println("Only distinct integers allowed - C321");
	           // System.out.println("students should ignore this if statement");
	            
	         }
	         while (A[f] < pivot) f++;
	         while (A[l] > pivot) l--;
	         swap (A, f, l);
	      }
	      if (A[f]==A[l])
	    	  return f--;
	      return f;
	   }

	   public static void Quicksort(int A[], int f, int l)
	   {
	      if (f >= l) return;
	      int pivot_index = partition(A, f, l);
	      Quicksort(A, f, pivot_index);
	      Quicksort(A, pivot_index+1, l);
	   }
	   public static void bubbleSort1(int[] x) {
		    int n = x.length;
		    for (int pass=1; pass < n; pass++) {  // count how many times
		        // This next loop becomes shorter and shorter
		        for (int i=0; i < n-pass; i++) {
		            if (x[i] < x[i+1]) {
		                // exchange elements
		                int temp = x[i];  x[i] = x[i+1];  x[i+1] = temp;
		            }
		        }
		    }
		}
		}


