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 Qualification;

import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class ProblemB {

	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(System.in);
		String output = "./result.txt";
		BufferedWriter writer = new BufferedWriter(new FileWriter(output));
		int T = in.nextInt();
		
		for (int numCase = 1; numCase <= T; numCase++) {
			int N = in.nextInt(); // num of googlers
			int S = in.nextInt(); // num of surprising triplets
			int p = in.nextInt(); // threshold
			int[] totalPts = new int[N];
			for (int i = 0; i < N; i++)
				totalPts[i] = in.nextInt();
			
			int count = 0;
			for (int total : totalPts) {
				int minPt = total/3;
				int remainder = total % 3;
				if (minPt >= p || (remainder > 0 && minPt + 1 >= p)) {
					count++;
					continue;
				}
				
				// might be a surprising triplets
				if (S > 0 && remainder >= 2 && minPt + 2 >= p) {
					count++;
					S--;
					continue;
				}
				
				if (S > 0 && remainder == 0 && minPt + 1 >= p && minPt > 0) {
					count++; S--;
					continue;
				}
			}
			String toPrint = "Case #" + numCase + ": " + count;
			System.out.println(toPrint);
			writer.write(toPrint + "\r\n");
		}
		writer.flush();
		writer.close();
	}
}
