import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

package com.jam.contest2012;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;

public class Dancing {

    public static int foo(final List<Integer> list, final int surprise,
	    final int p) {
	return find_max(new ArrayList<Integer>(), list, surprise, p);
    }

    private static int find_max(final ArrayList<Integer> unexpected,
	    final List<Integer> expected, final int surprise, final int p) {
	if (surprise == 0) {
	    return countExpected(expected, p) + countUnexpected(unexpected, p);
	}
	int max = Integer.MIN_VALUE;
	for (int i = 0; i < expected.size(); i++) {
	    if (expected.get(i) == 0)
		continue;
	    unexpected.add(0, expected.remove(i));
	    final int local = find_max(unexpected, expected, surprise - 1, p);
	    if (local > max) {
		max = local;
	    }
	    expected.add(i, unexpected.remove(0));
	}
	return max;
    }

    private static int countExpected(final List<Integer> expected, final int p) {
	int result = 0;
	for (final Integer $ : expected) {
	    switch ($ % 3) {
	    case 0: {
		if (($ / 3) >= p)
		    ++result;
		break;
	    }
	    case 1: {
		if ((($ + 2) / 3) >= p)
		    ++result;
		break;
	    }

	    case 2: {
		if ((($ + 1) / 3) >= p)
		    ++result;
		break;
	    }
	    }
	}
	return result;
    }

    private static int countUnexpected(final List<Integer> unexpected,
	    final int p) {
	int result = 0;
	for (final Integer $ : unexpected) {
	    switch ($ % 3) {
	    case 0: {
		if ((($ + 3) / 3) >= p)
		    ++result;
		break;
	    }
	    case 1: {
		if ((($ + 2) / 3) >= p)
		    ++result;
		break;
	    }

	    case 2: {
		if ((($ + 4) / 3) >= p)
		    ++result;
		break;
	    }
	    }
	}
	return result;
    }

    public static void main(final String[] args) {
	BufferedReader reader = null;
	try {
	    reader = new BufferedReader(new FileReader(new File(
		    "/home/artem/B-small-attempt0.in")));
	    final Integer numberOfCases = Integer.valueOf(reader.readLine());
	    for (int i = 1; i <= numberOfCases; ++i) {
		final String sentense = reader.readLine();
		final String[] tokens = sentense.split(" ");
		final int surprise = Integer.valueOf(tokens[1]);
		final int p = Integer.valueOf(tokens[2]);
		final List<Integer> list = new ArrayList<Integer>();
		for (int k = 3; k < tokens.length; ++k)
		    list.add(Integer.valueOf(tokens[k]));
		System.out
			.println("Case #" + i + ": " + foo(list, surprise, p));
	    }
	} catch (final Exception e) {
	    e.printStackTrace();
	} finally {
	    if (reader != null)
		try {
		    reader.close();
		} catch (final IOException e) {
		}
	}

    }

}