package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}


package gcj;
 
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

/**
 *
 * @author Mervin.Lavin
 */
public class Gcj
{

    public static void main
        (String[] args)
        throws Exception
    {
        doProb2( "B-large.in", "output.txt" );
    }
    
    private static void doProb2
        ( String inputFileName, String outputFileName )
        throws Exception
    {
        File inputFile = new File( inputFileName );
        Scanner scanner = null;
        scanner = new Scanner( inputFile );
        File outputFile = new File( outputFileName );
        BufferedWriter output = new BufferedWriter( new FileWriter( outputFile ) );
        
        int contestants, surpriseScores, minBestScore;
        int totalScore, aveScore, passedContestants;
        int testCases = scanner.nextInt();
        for ( int caseNum = 1; caseNum <= testCases; caseNum++ )
        {
          contestants = scanner.nextInt();
          surpriseScores = scanner.nextInt();
          minBestScore = scanner.nextInt();
          passedContestants = 0;
          for ( int contestant = 0; contestant < contestants; contestant++ )
          {
            totalScore = scanner.nextInt();
            aveScore = totalScore / 3;
            switch ( totalScore % 3 )
            {
                case 0:
                    if ( aveScore >= minBestScore )
                    {
                        passedContestants++;
                    }
                    else if ( ( surpriseScores > 0 )
                        && ( ( aveScore + 1 ) >= minBestScore ) 
                        && ( ( aveScore + 1 ) <= totalScore ))
                    {
                        passedContestants++;
                        surpriseScores--;
                    }
                    break;
                case 1:
                    if ( ( aveScore + 1 ) >= minBestScore )
                    {
                        passedContestants++;
                    }
                    break;
                case 2:
                    if ( ( aveScore + 1 ) >= minBestScore )
                    {
                        passedContestants++;
                    }
                    else if ( ( surpriseScores > 0 )
                        && ( ( aveScore + 2 ) >= minBestScore )
                        && ( ( aveScore + 2 ) <= totalScore ) )
                    {
                        passedContestants++;
                        surpriseScores--;
                    }
                    break;
            }
          }          
          output.append( "Case #" + caseNum + ": " + passedContestants );
          output.newLine();
        }
        scanner.close();
        output.close();
    }
}
