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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;

public class B {
	static int surprise=0;
	static int[] findMin(int[] a)
	{
		for(int i=0;i<a.length-1;i++)
			for(int j=i+1;j<a.length;j++)
			if(a[i]>a[j])
			{
				int t=a[i];
				a[i]=a[j];
				a[j]=t;
			}
		
		return a;
				
	}
	
	static boolean checkTriplet(int a, int b, int c, int maxScore)
	{
		if(Math.abs(a-b)>2 || Math.abs(a-c)>2 || Math.abs(b-c)>2)
			return false;
		if(Math.abs(a-b)==2 || Math.abs(a-c)==2 || Math.abs(b-c)==2)
			if((a>=maxScore || b>=maxScore || c>=maxScore) && surprise>0)
			{
				surprise--;
				return true;
			}
			else return false;
		if(a>=maxScore || b>=maxScore || c>=maxScore)
			return true;
		return false;
		
		
	}
	public static void main(String args[]) throws FileNotFoundException
	{
		Scanner sin=new Scanner(new File("C:\\Users\\DELL\\Desktop\\CodeJam\\B-small-attempt1.in"));
		PrintStream ps=new PrintStream(new File("C:\\Users\\DELL\\Desktop\\CodeJam\\BOut.out"));
		int cases=sin.nextInt();
		for(int i=1;i<=cases;i++)
		{
			int num=sin.nextInt();
			surprise=sin.nextInt();
			int maxScore=sin.nextInt();
			int count=0;
			int[] scores=new int[num];
			for(int j=0;j<num;j++)
				scores[j]=sin.nextInt();
			
			scores=findMin(scores);
			
			for(int j=0;j<scores.length;j++)
			{
				//System.out.println(" for "+scores[j]);
				if(maxScore>scores[j])
					continue;
				int div=scores[j]/3;
				int rem=scores[j]-div;
				if(rem<maxScore)
					continue;
				if(checkTriplet(div,rem/2,rem-rem/2, maxScore))
				{
					//System.out.println("check pass for "+div+" "+rem/2+" "+(rem-rem/2));
					count++;
				}
				else if(checkTriplet(div,maxScore,rem-maxScore,maxScore))
				{
					count++;
				}
			}
			
			ps.println("Case #"+i+": "+count);
			
		}
		ps.close();
	}

}
