import java.util.*;
import java.io.*;

public class DancingWithTheGooglers
{
    public DancingWithTheGooglers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("inputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        DancingWithTheGooglersMax [] rnc = new DancingWithTheGooglersMax[t];
        
        int i, j;
        int [] scores;
        int s, p;
        for(i = 0; i < t; i++)
        {
            scores = new int [inFile.nextInt()];
            s = inFile.nextInt();
            p = inFile.nextInt();
            for(j = 0; j < scores.length; j++)
                scores[j] = inFile.nextInt();
            
            rnc[i] = new DancingWithTheGooglersMax(i, scores, s, p, results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("outputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new DancingWithTheGooglers();
    }
    
    private class DancingWithTheGooglersMax extends Thread
    {
        int id;
        int s, p;
        int [] results, scores;
        
        public DancingWithTheGooglersMax(int i, int [] aScores, int aS, int aP,int [] res)
        {
            id = i;
            s = aS;
            p = aP;
            results = res;
            scores = aScores;
        }
        
        public void run()
        {
            int a = 0, b = 0;
            
            if(p == 0)
                results[id] = scores.length;
            else if(p == 1)
            {
                int y;
                y = 3*p - 3;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > 0)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
            else
            {
                int y, z;
                y = 3*p - 3;
                z = 3*p - 5;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > z)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
        }
    }
}
package gcj2012qual;

import java.io.*;
import java.util.*;

public class Dancing {

	/**
	 * @param args
	 */

	public static void main(String[] args) throws Exception{
		// TODO Auto-generated method stub

		Scanner input = new Scanner(new File("B-large.in"));
		PrintWriter output = new PrintWriter(new FileWriter("output"));
			
		// Scanner in = new Scanner(System.in);
		int case_num = input.nextInt();
		//String word = in.nextLine();
		
		int[][] surprising = new int[31][11];
		int[][] normal = new int[31][11];
		//int i = 0;
		for(int score = 0; score <= 30; score++)
			for(int s = 0; s <= 10; s++){
				if(s == 0 && score == 0){
					surprising[score][s] = 0;
					normal[score][s] = 1;
					continue;
				}
				if(score == 0){
					surprising[score][s] = 0;
					normal[score][s] = 0;
					continue;
				}
				if(s == 0){
					surprising[score][s] = 0;
					normal[score][s] = 1;
					continue;
				}
				
				if(score < s){
					surprising[score][s] = 0;
					normal[score][s] = 0;
					continue;
				}
				
				if(score >= s * 3){
					surprising[score][s] = 1;
					normal[score][s] = 1;
					continue;
				}
				
				if(s == 1 && score == 1){
					surprising[score][s] = 0;
					normal[score][s] = 1;
					continue;
				}
				
				if(s == 1 && score == 2){
					surprising[score][s] = 1;
					normal[score][s] = 1;
					continue;
				}
				
				if(score >= s + (s - 2) * 2){
					surprising[score][s] = 1;
					if(score > s + (s - 2) * 2 + 1){
						normal[score][s] = 1;
					}else{
						normal[score][s] = 0;
					}
					continue;
				}else{
					surprising[score][s] = 0;
					normal[score][s] = 0;
					continue;
				}
				
			}
		for(int i = 0; i < case_num; i++){
			int n = input.nextInt();
			int s = input.nextInt();
			int p = input.nextInt();
			
			int[] t = new int[n];
			
			int total = 0;
			int only_surprising = 0;
			
			for(int j = 0; j < n; j++){
				t[j] = input.nextInt();
				
				if(surprising[t[j]][p] == 1 || normal[t[j]][p] == 1)
					total = total + 1;
				
				if(surprising[t[j]][p] == 1 && normal[t[j]][p] == 0)
					only_surprising = only_surprising + 1;
			}
			
			output.println("Case #" + (i + 1) + ": " + (total - Math.max(0, (only_surprising - s))));
			
			
		}
		input.close();
		output.flush();
		output.close();
	}

}
