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 ab.gcj;

import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Surprising {

    public static void main(String args[])
    {

        Surprising s = new Surprising();
    }

    public Surprising()
    {
        try{
            BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

            int numOfTests = Integer.parseInt(reader.readLine());
            for(int j = 0 ; j < numOfTests ; j++)
            {
            String[] tstr = reader.readLine().split(" ");
            int numGooglers = Integer.parseInt(tstr[0]);
            int surprising = Integer.parseInt(tstr[1]);
            int p = Integer.parseInt(tstr[2]);
            int [] t = new int[numGooglers];
            for(int i =0 ; i < t.length; i++)
            {
                t[i] = Integer.parseInt(tstr[i+3]);
            }

            System.out.println("Case #"+(j+1)+": "+test(numGooglers,surprising,p,t) );
            }
        }catch(Exception e)
        {

        }
    }

    public int test(int n , int s , int p, int[] t)
    {
        int count = 0 ;
        int surprising = s;

        for(int i = 0 ; i < t.length; i++)
        {
            if(t[i] == 0 )
            {
                if(p == 0) count++;
                continue;
            }
            int a = t[i]/3;
            int b  = a * 3;
            int rem = t[i] - b;
            if(a >= p) {

                count++;
            }
            else
            {
                if((surprising != 0) && rem == 0 && (a + 1 >= p)) {
                    surprising--;
                    count++;
                    continue;
                }
                if( rem == 1 && a+1 >=p)
                {
                    count++;
                }
                if(rem == 2)
                {
                    if(a + 1 >= p )
                    {
                        count++;
                        continue;
                    }
                    if(surprising != 0 && a+2 >=p)
                    {
                        surprising--;
                        count++;
                    }
                }
            }


        }

        return count;

    }
}
