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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.ArrayList;

public class GooglerDance {

	public int calculate(int s, int p, ArrayList<Integer> t) {
		int ret = 0;

		for(int ti : t) {
			int minbase = ti / 3;
			int overflow = ti % 3;

			if(minbase >= p) {
				ret++;
				continue;

			} else if(overflow == 0) {
				if((minbase + 1 == p) && (minbase > 0) && (s > 0)) {
					ret++;
					s--;
					continue;
				}

			} else if(overflow == 1) {
				if(minbase + 1 == p) {
					ret++;
					continue;
				}

			} else if(overflow == 2) {
				if(minbase + 1 == p) {
					ret++;
					continue;
				} else if((minbase + 2 == p) && (s > 0)) {
					ret++;
					s--;
					continue;
				}

			}
		}

		return ret;
	}


	public static void main(String args[]) throws Exception {

		//initial reader by args[0]
		BufferedReader r = new BufferedReader(new FileReader(args[0]));
		int cases = Integer.parseInt(r.readLine());

		//initial writer by args[1]
		PrintWriter w = new PrintWriter(args[1]);

		//do calculate
		GooglerDance g = new GooglerDance();
		for(int i = 1; i <= cases; i++) {
			String[] input = r.readLine().split(" ");
			int n = Integer.parseInt(input[0]);
			ArrayList<Integer> t = new ArrayList<Integer>();
			for(int x = 0; x < n; x++) {
				t.add(Integer.parseInt(input[x+3]));
			}

			w.println("Case #" + i + ": " + g.calculate(
					Integer.parseInt(input[1]),
					Integer.parseInt(input[2]),
					t)
			);
		}

		//close file handles
		w.close();
		r.close();
	}

}
