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.google.cj12;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;

class Dancing {

	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader(new FileReader("D:/Temp/B-small-attempt1.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(
				"D:/Temp/B-small-attempt1.out")));
		new Dancing().solve(f, out);
		out.close();
	}
	
	private void solve(BufferedReader f, PrintWriter out) throws IOException {
		int T = read(f);
		for (int i=0; i<T; i++) {
			int count = 0;
			String[] s = f.readLine().split(" ");
			
			int N = Integer.parseInt(s[0]);
			int S = Integer.parseInt(s[1]);
			int p = Integer.parseInt(s[2]);
			
			for (int j=0; j<N; j++) {
				int t = Integer.parseInt(s[j+3]);
				int base = t/3;
				
				int max = t%3==0? base : base+1;
				if (max >= p) {
					count++;
					continue;
				}
				
				if (S == 0 || t<2 || t%3==1) continue;
				
				max = t%3==0? base+1 : base+2;
				if (max >= p) {
					count++;
					S--;
				}
			}
			
			out.println("Case #" + (i+1) + ": " + count);
		}
	}
	
	public int read(BufferedReader f) throws IOException {
		return Integer.parseInt(f.readLine());
	}
}
