/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

package com.dennis.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class DancingGoogle {

	/**
	 * @param args
	 */
	
	public static void main(String[] args) throws IOException{

		
		BufferedReader fin = new BufferedReader(new FileReader("dancing.in"));
		PrintWriter fout = new PrintWriter(new BufferedWriter(new FileWriter("dancing.out")));

		StringTokenizer stringy;
		
		int times = Integer.parseInt(fin.readLine());
		
		
		for(int x= 0 ; x<times; x++){
			stringy= new StringTokenizer(fin.readLine());
			int numg = Integer.parseInt(stringy.nextToken());
			int surprises = Integer.parseInt(stringy.nextToken());
			int limit  = Integer.parseInt(stringy.nextToken());
			int[] googlers = new int[numg];
			
			for(int a = 0; a<numg; a++){
				googlers[a] = Integer.parseInt(stringy.nextToken());
			}
			
			Arrays.sort(googlers);
			
			int[] less = new int[numg];
			
			
			
			for(int a = 0; a<numg; a++){
				
				if(googlers [a] <= 1){
					if(googlers[a]==1) less[a] = 1;
					if(googlers[a]==0) less[a] = 0;
				}				
				else if(googlers[a]%3 == 0){
					less[a] = googlers[a]/3;  
				}
				else if(googlers[a]%3 == 1){
					less[a] = googlers[a]/3+1;
				}
				else if(googlers[a]%3 == 2){
					less[a] = googlers[a]/3+1;
				}
				
			}

			int[] more = new int[numg];
			for(int a = 0; a<numg; a++){
				
				if(googlers [a] <= 1){
					if(googlers[a]==1) more[a] = 1;
					if(googlers[a]==0) more[a] = 0;
				}				
				else if(googlers[a]%3 == 0){
					more[a] = googlers[a]/3+1;  
				}
				else if(googlers[a]%3 == 1){
					more[a] = googlers[a]/3+1;
				}
				else if(googlers[a]%3 == 2){
					more[a] = googlers[a]/3+2;
				}
				
			}
			
			for(int a= 0 ; a<numg;a++){
				if(surprises==0) break;
				
				if(more[a]!= less[a] && more[a] == limit){
					surprises--;
					less[a] = more[a];
				}
				
				
			}
			
			
			
			
			int count =0;
			for(int c=0; c<numg; c++){
				System.out.println(less[c]);
				if(less[c]>=limit) count++;
			}
			
			fout.println("Case #" + (x+1) + ": " + count);
			
		}
		
		
		
		
		
		fout.close();
		System.exit(0);

	}

}
