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


public class BestResult 
{
	public int result(String input)throws Exception
	{
		String[] array= input.split(" ");
		int noOfGooglers = Integer.parseInt(array[0]);
		int surprising = Integer.parseInt(array[1]);
		int p = Integer.parseInt(array[2]);
		int x;
		int[] listOfBestResults = new int[noOfGooglers];
		int count = 0;
		for(int i=3;i<array.length;i++)
		{
			x = Integer.parseInt(array[i]);
			if(canItBeBestResult(x, p))
			{
				listOfBestResults[count] = x;
				count++;
			}
		}
		int bestResultCount = 0;
		for(int i=0;i<count;i++)
		{
			if(listOfBestResults[i]%3 == 2)
			{
				if(listOfBestResults[i]/3>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				
				else if((listOfBestResults[i]/3) + 2>=p && (listOfBestResults[i]/3) + 1>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				else if((listOfBestResults[i]/3) + 2>=p && surprising!=0)
				{
					System.out.println("list of best result surprising " + listOfBestResults[i]);
					bestResultCount++;
					surprising--;
				}
			}
			else if(listOfBestResults[i]%3 == 1 )
			{
				if(listOfBestResults[i]/3>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				else if((listOfBestResults[i]/3) + 1>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				else if((listOfBestResults[i]/3) + 1>=p && surprising!=0)
				{
					System.out.println("list of best result surprising " + listOfBestResults[i]);
					bestResultCount++;
					surprising--;
				}
			}
			else if( listOfBestResults[i]%3 == 0 )
			{
				if(listOfBestResults[i]/3>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				
				else if((listOfBestResults[i]/3) + 1>=p && surprising!=0)
				{
					System.out.println("list of best result surprising " + listOfBestResults[i]);
					bestResultCount++;
					surprising--;
				}
			}
			
		}
		return bestResultCount;
		
	}
	public boolean canItBeBestResult(int x, int p)
	{
		if(p==0)
		{
			return true;
		}
		if( x%3 == 2 && ((x/3)+2) >= p)
		{
			return true;
		}
		else if( x%3 == 1 && ((x/3)+1) >= p)
		{
			return true;
		}
		else if( x%3 == 0 && ((x/3)+1)>=p && x!=0)
		{
			return true;
		}
		
		return false;
	}
}
