package googlers;

import java.util.Scanner;
import java.util.PriorityQueue;
import java.util.Comparator;
public class Googlers {
	
	public static void main(String[] args) {
		
		int n,s,p,count=0,t;		
		Scanner sin=new Scanner(System.in);
		
		t=Integer.parseInt(sin.nextLine());
		
		
		int result[]=new int[t];
		int j=0;
		
		if(t>=1 && t<=100)
		{
		for (int k = 0; k < t; k++) {
		count=0;	
		
			
        String ip = sin.nextLine();
        
        String[]tokens=ip.split(" ");
		
		
		n=Integer.parseInt(tokens[0]);
		s=Integer.parseInt(tokens[1]);
		p=Integer.parseInt(tokens[2]);
		
		if( (s>=0 && s<=n) && (p>=0 && p<=10) )
		{
		int[] total=new int[n];
		
		
		for (int i = 0; i < n; i++)
        {
            total[i] = Integer.parseInt(tokens[i+3]);
        }
		
		Comparator comparator=new PointComparator();
		PriorityQueue pq=new PriorityQueue<Point>(1, comparator);
		
		for (int i = 0; i < n; i++)
		{
			
			int x=total[i]/3;
			int r=total[i]%3;
			if(x>=p)
				count++;
			else if(x<(p-2))
				continue;
			else
			{
				//System.out.println("enter "+x+" "+(p-2));
				if(p-x==1)
				{
					Point temp=new Point();
					temp.q=x;
					temp.r=r;
					pq.add(temp);
				}
				else  // p-x=2
				{
					if(r==0)
						continue;
					else
					{
						Point temp=new Point();
						temp.q=x;
						temp.r=r;
						pq.add(temp);
					}				
					
				}
					
			}
			//System.out.println("hi "+pq.size());
			
		}
		
		
		
		while(pq.size()!=0)
		{
			Point temp=(Point)pq.remove();
			if(p-temp.q==1 && temp.q!=0)
			{
				if(temp.r>=1)
					count++;
				else
				{
					if(s!=0)
					{
						s--;
						count++;
					}
				}
			}
			else if(p-temp.q==2)
			{
				if(s!=0 && (temp.q+temp.r)>=p)
				{
					s--;
					count++;
				}
			}
			
				
		}
		
		//System.out.println(p);
		
		result[j++]=count;
		
		}
		}
		
		for (int i = 0; i < t; i++) 
		{
			System.out.println("Case #"+(i+1)+": "+result[i]);
		}
		}
		
	}
        
        
		
		/*Point x=new Point();
		x.q=8;
		Point y=new Point();
		y.q=6;
		Point z=new Point();
		z.q=7;
		
		pq.add(x);
		pq.add(y);
		pq.add(z);
		*/
		
		
		
		
	

}

class PointComparator implements Comparator<Point>
{
    @Override
    public int compare(Point x, Point y)
    {
        // Assume neither string is null. Real code should
        // probably be more robust
        if (x.q < y.q)
        {
            return 1;
        }
        if (x.q  > y.q)
        {
            return -1;
        }
        return 0;
    }
}



class Point
{
	int q,r;

	public int getQ() {
		return q;
	}

	public void setQ(int q) {
		this.q = q;
	}

	public int getR() {
		return r;
	}

	public void setR(int r) {
		this.r = r;
	}
	
	
}

package QualificationRound.dancingwiththegooglers;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;

public class Scoring {
	private List<String> inputLines = new ArrayList<String>();
	private List<String> outputLines = new ArrayList<String>();
	private static final String INPUT_FILE_NAME = "B-small-attempt0.in";
	private static final String OUTPUT_FILE_NAME = "output.txt";
	
	private List<SingleCase> cases = new ArrayList<Scoring.SingleCase>();
	
	public static void main(String[] args) {
		Scoring s = new Scoring();
		s.readLines();
		s.parseLines();
		s.generateOutput();
		s.outputLines();
	}
	
	
	private void readLines() {
		try {
			BufferedReader reader = new BufferedReader(new FileReader(INPUT_FILE_NAME));

			String line = reader.readLine();
			
			line = reader.readLine();
			while (line != null) {
				inputLines.add(line);
				line = reader.readLine();
			}
			
			reader.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
	
	
	private void parseLines() {
		for (String inputLine : inputLines) {
			int readNumbers = 0;
			SingleCase singleCase = new SingleCase();
			String[] split = inputLine.split(" ");
			for (String s : split) {
				switch (readNumbers) {
					case 0:
						singleCase.numberOfGooglers = Integer.parseInt(s);
						break;
					case 1:
						singleCase.numberOfSurprises = Integer.parseInt(s);
						break;
					case 2:
						singleCase.minBestResult = Integer.parseInt(s);
						break;
					default:
						singleCase.scores.add(Integer.parseInt(s));
				}
				readNumbers++;
			}
			cases.add(singleCase);
		}
	}
	
	
	private void generateOutput() {
		int caseNumber = 1;
		for (SingleCase singleCase : cases) {
			outputLines.add(getOutputPrefix(caseNumber++) + singleCase.getResult());
		}
	}
	

	private void outputLines() {
		try {
			BufferedWriter writer = new BufferedWriter(new FileWriter(OUTPUT_FILE_NAME, false));
			
			for (String line : outputLines) {
				writer.write(line);
				if (!line.equals(outputLines.get(outputLines.size() - 1))) {
					 writer.write("\n");
				}
			}
			
			writer.close();
			
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
	
	private class SingleCase {
		@SuppressWarnings("unused") //unnecessary. Just use number of scores
		private int numberOfGooglers = 0;
		private int numberOfSurprises = 0;
		private int minBestResult = 0;
		private List<Integer> scores = new ArrayList<Integer>();
		
		private int getResult() {
			int clearPasses = 0;
			int potentialSurprises = 0;
			
			//Minimum clear pass is x + x-1 + x-1 where x is the minBestResult 
			int minForClearPass = (minBestResult * 3) - 2;
			//Minimum surprise pass is x + x-2 + x-2 where x is the minBestResult
			int minForSurprisePass = (minBestResult * 3) - 4;
			if (minForSurprisePass  < 1) {
				if (minBestResult == 0) {
					minForSurprisePass = 0;
				}
				else {
					minForSurprisePass = 1;
				}
			}
			
			for (int score : scores) {
				if (score >= minForClearPass) {
					clearPasses++;
				}
				else if (score >= minForSurprisePass) {
					potentialSurprises++;
				}
			}
			
			return clearPasses + (Math.min(potentialSurprises, numberOfSurprises));
		}
	}
	
	private String getOutputPrefix(int number) {
		return "Case #" + number + ": ";
	}
}
