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.*;
import javax.swing.*;
import javax.swing.JOptionPane.*;
import java.awt.*;
import java.awt.event.*;
import java.io.*;
import javax.swing.text.*;
import java.io.File;
import javax.swing.filechooser.FileFilter;
import javax.swing.text.html.*;
import java.util.Scanner;
import java.util.StringTokenizer;

class Dancings
{
   public static void main(String args[])
	{
	  
	  int jumlahN[]=new int[101];
	 
	 
	  
	  int hasil[]=new int[101];
	  
	  
	  int i=0;
      int j=0;
      int k=0;
      int l=0;
	  int il=0;
	  int cok3=0;
	  
      try{
		// Open the file that is the first 
		// command line parameter
		FileInputStream fstream = new FileInputStream("b.txt");
		// Get the object of DataInputStream
		DataInputStream in = new DataInputStream(fstream);
        BufferedReader br = new BufferedReader(new InputStreamReader(in));
		String strLine;
		//Read File Line By Line
		j=0;
		while ((strLine = br.readLine()) != null) 	{
			// Print the content on the console
		    if(j==0)
            {
             i=Integer.parseInt(strLine);	
             if(i>100)
              {
	           i=100;
              }
             else if(i<1)
              {
	           i=1;
              } 			
			 System.out.println (i);
		    }
			else
			{
			 int jum=0;
			 int panjangtext=strLine.length();
			 int posisi=0;
			 //String isi=strLine.trim();
			 char arr[]=strLine.toCharArray(); 

			 Character n2=arr[0];
             String s1=n2.toString();
             int n= Integer.parseInt(s1);			 
			 
			  String tmp="";
			  for(l=2; l<panjangtext; l++)
			  {
				 if(arr[l]==' ')
				 {
			        break;
				 }
				 else
				 {
				  tmp=tmp+arr[l];
				 }
			  } 
			  
			  int s=Integer.parseInt(tmp);
			  
			  String tmp2="";
			  for(k=l+1; k<panjangtext; k++)
			  {
				 if(arr[k]==' ')
				 {
			        break;
				 }
				 else
				 {
				  tmp2=tmp2+arr[k];
				 }
			  } 
			  
			  int p=Integer.parseInt(tmp2);	
			  
			  System.out.println("nilai n"+n);
			  System.out.println(strLine);
			  
			  System.out.println("nilai s:"+s);
			  System.out.println("nilai p:"+p);
			  
			  int m=1;
			  tmp="";
			  while(m<=n)
			  {
			     
			    for(k=k+1; k<panjangtext; k++)
			    {
				 if(arr[k]==' ')
				 {
				   
			        break;
				 }
				 else
				 {
				  
				  tmp=tmp+arr[k];
				 }
			    }
				 
				 tmp=tmp.trim();
				 int tmp4=Integer.parseInt(tmp);	
			     jumlahN[m]=tmp4;
				 tmp=" ";
			    
			   
			   m++;
			  }
			  
			  m=1;
			  
			  int p2=p*2;
			  while(m<=n)
			  {
			    
			   System.out.println("nilai m :"+m+" :"+jumlahN[m]);
			   int cok2=jumlahN[m];
			   int jos=cok2-p2;
			   int param=p-2;
			   if(jos>=param)
			   {
			    
			     System.out.println("Masuk 1");
			    jum++;
			   }
			   else if(cok2>0 && s>0)
			   {
			    cok3=cok2-p;
				int p3=cok3/2;
				
				if(p3>=param)
				{
				jum++;
				s--;
				}
			     System.out.println("Masuk 2");
			    
			   }
			  
			  
			   
			   m++;
			  }
			  
			  hasil[j]=jum; 
            }
		//Close the input stream
		    j++;
		   }
	       in.close();
		}
		catch (Exception e){//Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
		
		
		
      
	  try
	  {
	   File makefile= new File("resultdancing.txt");
       FileWriter fwrite= new FileWriter(makefile);
       PrintWriter pw=new PrintWriter(fwrite);	 
	   for(il=1; il<=i; il++)
         {
		  pw.println("Case #"+(il)+": "+hasil[il]+"\n");
		  System.out.println("case #"+(il)+": "+hasil[il]+"\n");
		 }
	   fwrite.flush();
	   fwrite.close();
	  }
	  catch(IOException e)
	  {
	   e.printStackTrace();
	  }
	  
	  
	}
	

	

  

	
	
	
}

