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.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.File;
import java.io.PrintStream;
import java.util.Scanner;
import java.util.Arrays;
import java.util.ArrayList;

public class Dancers{   
  public static ArrayList<Triplet> scores;
  
  public static void main(String arg[]){
    System.out.print("Enter the file path of the input file : ");
    String path = new Scanner(System.in).nextLine();
    String ANS ="", output="", test;
    int diff;
    
    try{
      Scanner read = new Scanner(new File(path));
      int testCases =  Integer.parseInt(read.nextLine());
      int cn=0; String tongue; 
      while(cn++<testCases){
        test  = read.nextLine();
        
        output = "Case #"+cn+": "+ solve(test);//WRITE ANS TO DIFFERENT FILE 
        ANS += output +" \n";
        System.out.println(ANS);
      }
      writeToFile("dancers.out",ANS);
    }
    catch(FileNotFoundException e){//if file is not found
      System.err.println("data file \'"+path+"\' was not found\nPress <enter> to exit...");
      (new Scanner(System.in)).nextLine();
      System.exit(1);
    }
  }
  
  public static void writeToFile(String file, String text){
    PrintStream out = null;
    try {
      out = new PrintStream(new FileOutputStream(file));
      out.print(text);
    }
    catch(Exception e){}
    finally {
      if (out != null) out.close();
    }   
  }
  
  public static int solve(String test){
    String temp[] = test.split(" ");
    ArrayList<Triplet> tempList = new ArrayList<Triplet>();
    Triplet[] scores;
    int dancerNo, surpriseNo, bestResult;
      
    dancerNo = Integer.parseInt(temp[0]);
    surpriseNo = Integer.parseInt(temp[1]);
    bestResult = Integer.parseInt(temp[2]);
    int counter = 0;
    
    while(counter < dancerNo){
      tempList.add(new Triplet(temp[3+counter])); 
      counter++;
    }
    
    scores = tempList.toArray(new Triplet[tempList.size()]);
    
    
    Arrays.sort(scores);
    
    scores = doTheSurprises(scores,surpriseNo, bestResult);  
    
    System.out.println(Arrays.toString(scores));
    
    return count(scores, bestResult);
  }
  
  public static Triplet[] doTheSurprises(Triplet sc[], int surprise, int max){
    Triplet temp;
    int sNo=0;
    for(int i=sc.length-1; i>=0; i--){
      if(sNo==surprise){
        break;
      }
      
      if(sc[i].scores[2]<max){
        if(sc[i].doSurprise()){
          sNo++;
        }
      }
    }    
    return sc;
  }
  
  public static int count(Triplet sc[], int max){
    int temp=0;
    for(int i=0; i<sc.length; i++){
      if(sc[i].scores[2]>=max){
        temp++;
      }
    }
    return temp;}
}

class Triplet implements Comparable<Triplet>{
  public int scores[] = new int[3];
  public Triplet(int x, int y, int z){
    scores[0]=x;
    scores[1]=y;
    scores[2]=z;
  }
  
  public Triplet(String x){setThrees(Integer.parseInt(x));}
  
  public Triplet(int x){setThrees(x);}
  
  public void setThrees(int numb){
    this.scores[0] =numb/3;
    this.scores[1] = (numb-scores[0])/2;
    this.scores[2] = numb - scores[0] - scores[1];
  } 
  
  public int compareTo(Triplet x){
    if(scores[2]<x.scores[2]){
      return -1;
    }
    else if(scores[2]>x.scores[2]){
      return 1;
    }
    else{
      return 0;
    }
    
  }
  
  public boolean doSurprise(){
    int s1 = scores[1], s2 = scores[2];
    
    if(s1 == s2){
      s1--; s2++;
      if(s1>=0 && s2<=10){
        scores[1] = s1;
        scores[2] = s2;
        return true;
      }
    }
    return false;
  }
  
  public String toString(){
    return Arrays.toString(scores);
  }
}
