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

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Scanner;

public class Main {

	private Scanner scanner;
	private PrintWriter writer;

	public Main(InputStream is, OutputStream os) {
		scanner = new Scanner(is);
		writer = new PrintWriter(os);
	}

	public void solve() {
		
		// Unit Tests:
		int tmp;
		int tmp1[] = {15,13,11};
		if (calculate(1, 5, tmp1)!=3) return;
		int tmp2[] = {23,22,21};
		if (calculate(0, 8, tmp2)!=2) return;
		int tmp3[] = {8,0};
		if (calculate(1, 1, tmp3)!=1) return;
		int tmp4[] = {29,20,8,18,18,21};
		if (calculate(2, 8, tmp4)!=3) return;
		
		for (int i=0; i<200; i++)
			System.out.println("");

		int cases = scanner.nextInt();

		for (int i = 1; i <= cases; i++) {
			writer.print("Case #");
			writer.print(i + ": ");

			scanner.nextLine();
			int n = scanner.nextInt(); // number of Googlers
			int s = scanner.nextInt(); // number of surprising triplets
			int p = scanner.nextInt(); // minimum score
			int t[] = new int[n];
			for (int j = 0; j < n; j++)
				t[j] = scanner.nextInt();

			System.out.println(i + ": MinScore=" + p + ", Surprising Triplets=" + s);
			int result = calculate(s, p, t);

			writer.println(result);
			System.out.println(" -> " + result);
			System.out.println("-------------");
		}
		writer.flush();
	}

	private int calculate(int noSurprisingScores,
			int minimumScore, int[] scores) {
		int result = 0;

		for (int score : scores) {
			int triplet[] = new int[3];
			System.out.print(score + ": ");
			switch (score % 3) {
			case 0:
				if (score / 3 >= minimumScore) {
					result++;
					System.out.println((score / 3) + "," + (score / 3) + "," + (score / 3));
				} else {
					if (noSurprisingScores > 0)
						if (score / 3 + 1 >= minimumScore && score / 3 - 1 >= 0) {
							result++;
							noSurprisingScores--;
							System.out.println((score / 3 - 1) + "," + (score / 3) + "," + (score / 3 + 1) + " *");
						}
				}
				break;
			case 1:
				if ((score-1)/3 + 1 >= minimumScore) {
					result++;
					System.out.println((score-1)/3 + "," + ((score-1)/3) + "," + ((score-1)/3 + 1));
				} else {
					// Surprising Triplet führt nicht zur Erhöhung des max Scores
				}
				break;
			case 2:
				if ((score-2)/3 + 1 >= minimumScore) {
					result++;
					System.out.println((score-2)/3 + "," + ((score-2)/3 + 1) + "," + ((score-2)/3 + 1));
				} else {
					if (noSurprisingScores > 0)
						if ((score - 2) / 3 + 2 >= minimumScore) {
							result++;
							noSurprisingScores--;
							System.out.println((score-2)/3 + "," + (score-2)/3 + "," + ((score-2)/3 + 2) + " *");
						}
				}
				break;
			}

		}

		return result;
	}

	/*
	 * private boolean exceedsMinumumScore(int[] triplet, int minScore) { for
	 * (int i=0; i<3; i++) if (triplet[i] >= minScore) return true; return
	 * false; }
	 */

	public static void main(String[] args) {
		try {
			InputStream is = new FileInputStream("B-small-attempt.in");
			OutputStream os = new FileOutputStream("B-small-attempt.out");
			Main problem = new Main(is, os);
			problem.solve();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}

		System.out.println("finished");
	}
}
