package problem1;

import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;





public class Problem1 {

    public static void main(String[] args) throws FileNotFoundException, IOException{
        try {
             TextIO.readFile("L:\\Coodejam\\Input\\Input.txt");
        }
        catch (IllegalArgumentException e) {
              System.out.println("Can't open file ");
              System.exit(0);
         }
        
        FileOutputStream fout = new FileOutputStream("L:\\Coodejam\\Output\\output.txt");
        PrintStream ps=new PrintStream(fout);
        
        int cases=TextIO.getInt();
        int googlers=0,surprising=0,least=0;
        for(int i=0;i<cases;i++){
            int counter=0;
            googlers=TextIO.getInt();
            surprising=TextIO.getInt();
            least=TextIO.getInt();
            int score[]=new int[googlers];
            for(int j=0;j<googlers;j++){
                score[j]=TextIO.getInt();
                 }
            
            
            
            
            Arrays.sort(score);
            int temp=0;
            int sup[]=new int[surprising];
            
          for(int j=0;j<googlers && surprising>0;j++){
               if(biggestNS(score[j])<least && biggestS(score[j])==least){
                   surprising--;
                   counter++;
                }
               }
           
            for(int j=0;j<googlers;j++){
                if(surprising==0)temp=biggestNS(score[j]);
                    
                else {
                    temp=biggestS(score[j]);
                    surprising--;     
                } 
                   if(temp>=least)counter++;
           
             }
            
             ps.println("Case #"+(i+1)+": "+counter);
        }
    }
    
   static int biggestNS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-1)/3)+1;
   }
   
   static int biggestS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-2)/3)+2;
   }
}
package dancing;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;

public class DanceAllNight {
	
	
	public static void main(String[] args) throws Exception
	{
		BufferedReader br = new BufferedReader(new FileReader(new File("test.txt")));
		BufferedWriter wr = new BufferedWriter(new FileWriter(new File("output.txt")));
		int count = Integer.parseInt(br.readLine());
		int yes,surprising,p,numsurprising,current,div3,output;
		String[] buffer;
		int[] values;
		for(int i=1; i<=count; i++)
		{
			String line = br.readLine();
			buffer = line.split(" ");
			values = new int[buffer.length];
			for(int j=0; j<buffer.length; j++)
			{
				values[j] = Integer.parseInt(buffer[j]);
			}
			yes = 0;
			surprising =0;
			p = values[2];
			numsurprising = values[1];
			
			for(int k=3; k<values.length; k++)
			{
				current = values[k];
				div3 = current/3;
				if(current % 3 == 0)
				{
					if(div3 >= p)
					{
						yes++;
					}
					else if(div3 == p-1  && current >= p)
						{
							surprising++;
						}
				}
				else if(current %3 == 1)
				{
					if(div3 >= p-1 && current >= p)
					{
						yes++;
					}
					
				}
				else
				{
					if(div3 >= p-1 && current >= p)
					{
						yes++;
					}
					else if(div3  == p-2 && current >= p)
					{
						surprising++;
					}
				}
					
				
			}
			output = Math.min(yes+surprising, yes+numsurprising);
			//make sure that its not more than the total # of contestants
			//output = Math.min(output, values[0]);
			wr.write("Case #"+i+": "+output);
			
			wr.newLine();
			
		}
		wr.close();
	}
	
}
