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 com.seol.codejam;


import java.io.File;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;

/**
 * Solution for http://code.google.com/codejam/contest/1150485/dashboard#s=p1
 */
public class DancingWithTheGooglers {

	public static int solveCase(int[] scores, int surpriseNum, int neededScore) {
		int len = scores.length;
		int maxWithNeeded = neededScore*3;
		int suprCnt = surpriseNum;
		int res=0;
		for(int i = 0; i < len; i++) {
			if(scores[i] < neededScore) {
				continue;
			}else if(scores[i] >= maxWithNeeded ||  maxWithNeeded - scores[i] <= 2) {
				res++;
			} else if (maxWithNeeded - scores[i] <= 4 && suprCnt > 0){
				suprCnt--;
				res++;
			}
		}
		
		return res;	
	}


	
	public static void main(String[] args) throws Exception {
		
		solveAllCases("D:/worspaces/google_codejam/test_data/dance2");
	}

	public static void solveAllCases(String fileName) throws Exception {
		Scanner sc = new Scanner(new File(fileName));
		int cases = sc.nextInt();
//		String tmp = sc.nextLine();
		for (int i = 0; i < cases; i++) {
			int n = sc.nextInt();
			int surp = sc.nextInt();
			int score = sc.nextInt();
			int[] ar = new int[n];
			for(int q =0; q < n; q++) {
				ar[q] = sc.nextInt();
			}
			int res = solveCase(ar, surp, score);
			
			System.out.println("Case #" + (i + 1) + ": " + res);
			// System.out.printf("Case #%1$d: %2$.7f \n" , (i+1), res);

		}
		// System.out.println("MAX:" + max);
	}

}
