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

import java.io.PrintWriter;
import java.util.Scanner;

public class PB {
	static Scanner sc = new Scanner(System.in);
	static PrintWriter pw = new PrintWriter(System.out);

	public static void main(String[] args) {
		int t = sc.nextInt();
		for (int i = 1; i <= t; i++) {
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int[][] d1 = new int[n + 1][s + 1];
			int[][] d2 = new int[n + 1][s + 1];

			for (int j = 1; j <= n; j++) {
				int x = sc.nextInt();

				for (int k = 0; k <= Math.min(s, j); k++) {
					if (k != 0)
						d1[j][k] = Math.max(d1[j - 1][k - 1], d2[j - 1][k - 1])
								+ (check(x, p, true) ? 1 : 0);
					if (k < j)
						d2[j][k] = Math.max(d2[j - 1][k], d1[j - 1][k])
								+ (check(x, p, false) ? 1 : 0);
				}
			}
			pw.println("Case #" + i + ": " + Math.max(d1[n][s], d2[n][s]));
		}
		pw.flush();
	}

	static boolean check(int a, int p, boolean surprised) {

		if (surprised) {
			switch (a % 3) {
			case 0:
				return (a > 0 && a < 28 && ((a + 3) / 3) >= p);
			case 1:
				return (a > 1 && a < 29 && ((a + 2) / 3) >= p);
			case 2:
				return (a < 27 && ((a + 4) / 3) >= p);
			}
		} else {
			switch (a % 3) {
			case 0:
				return (a / 3) >= p;
			case 1:
				return ((a + 2) / 3) >= p;
			case 2:
				return ((a + 1) / 3) >= p;
			}
		}
		return false;
	}
}
