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 com.elbr.codejam2012.qualification.B;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.net.URL;

public class Dancing {
	private static boolean debug = false;

	private static String findP;

	private static int p = 0;

	private static int s = 0;

	private static boolean checkDiff(String prefix, boolean checkNoSurprise) {
		prefix = prefix.trim();

		if (prefix.length() == 0) {
			return true;
		}

		String[] params = prefix.split("\\s");
		int max = -1;
		int min = -1;

		for (String s : params) {
			int i = Integer.parseInt(s);
			if (min == -1) {
				min = i;
			}

			if (max == -1) {
				max = i;
			}

			max = Math.max(max, i);
			min = Math.min(min, i);
		}

		if ((max > 10) || (min > 10)) {
			return false;
		}

		if (((max - min) > 2) || (max < p)) {
			return false;
		}

		if ((max - min) < 2) {
			return true;
		}

		if (checkNoSurprise) {
			return false;
		}

		if (s == 0) {
			return false;
		}

		s--;

		return true;
	}

	public static int count(String input, String countString) {
		return input.trim().split("\\Q" + countString + "\\E", -1).length - 1;
	}

	public static void main(String[] in) throws IOException {
		// String fileName = "sample2.in";
		String fileName = "B-small-attempt3.in";
		URL file = Dancing.class.getResource(fileName);
		String path = file.getFile();
		BufferedReader reader = new BufferedReader(new FileReader(path));

		File fileOut = new File(fileName + ".out");
		fileOut.createNewFile();
		BufferedWriter writer = new BufferedWriter(new FileWriter(fileOut));

		int numOfCases = Integer.parseInt(reader.readLine());

		for (int t = 0; t < numOfCases; t++) {
			String line = reader.readLine();

			String outputLine = "Case #" + (t + 1) + ": " + result(line);
			if (true || debug) {
				System.out.println(outputLine);
			}
			writer.write(outputLine + System.getProperty("line.separator"));
		}

		reader.close();
		writer.close();
	}

	public static void partition(int n, boolean checkNoSurprise) {
		findP = null;

		partition(n, n, "", checkNoSurprise);
	}

	public static void partition(int n, int max, String prefix,
			boolean checkNoSurprise) {
		if (findP != null) {
			return;
		}

		if (n == 0) {
			if ((count(prefix, " ") == 2)) {
				if (debug) {
					System.out.println("Check votes: " + prefix);
				}

				if (checkDiff(prefix, checkNoSurprise)) {
					findP = prefix;
				}
			}
			return;
		}

		for (int i = Math.min(max, n); i >= 1; i--) {
			String np = prefix + " " + i;
			if (count(prefix, " ") <= 2) {
				partition(n - i, i, np, checkNoSurprise);
			}
		}
	}

	private static int result(String line) {
		String[] params = line.split("\\s");
		int n = Integer.parseInt(params[0]);
		s = Integer.parseInt(params[1]);
		p = Integer.parseInt(params[2]);

		System.out.println(line + ": " + s + ", " + p);

		int[] m = new int[n];

		int a = 0;
		for (int i = 0; i < n; i++) {
			m[i] = Integer.parseInt(params[3 + i]);

			if (debug) {
				System.out.println(m[i] + " => ");
			}

			if ((m[i] == 0) && (p == 0)) {
				findP = "0 0 0";
				if (debug) {
					System.out.println("not surprise => " + findP);
				}
				a++;
			} else {
				partition(m[i], true);

				if (findP != null) {
					a++;
					if (debug) {
						System.out.println("not surprise => " + findP);
					}
				} else {
					if (debug) {
						System.out.println("---");
					}
					partition(m[i], false);
					if (findP != null) {
						a++;
						if (debug) {
							System.out.println("surprise => " + findP);
						}
					}
				}
			}
		}

		return a;
	}
}
