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

import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Map.Entry;

/**
 * Pair: typed 2-tuple
 */
public class Pair<L, R> {

	private final L left;
	private final R right;

	public R getRight() {
		return right;
	}

	public L getLeft() {
		return left;
	}

	public Pair(final L left, final R right) {
		this.left = left;
		this.right = right;
	}

	/** Convenience method so type params of pair don't have to be specified: just do Pair.make(l, r) */
	public static <L, R> Pair<L, R> make(L left, R right) {
		return new Pair<L, R>(left, right);
	}

	// ---------------------------------------------------------------------------------------------------

	private static final boolean objEquals(Object p1, Object p2) {
		if (p1 == null)
			return p2 == null;
		return p1.equals(p2);
	}

	@Override
	public final boolean equals(Object o) {
		if (!(o instanceof Pair<?, ?>)) {
			return false;
		} else {
			final Pair<?, ?> other = (Pair<?, ?>) o;
			return objEquals(getLeft(), other.getLeft()) && objEquals(getRight(), other.getRight());
		}
	}

	@Override
	public int hashCode() {
		int hl = getLeft() == null ? 0 : getLeft().hashCode();
		int hr = getRight() == null ? 0 : getRight().hashCode();
		return (hl + (127 * hr)) ^ (hr << 1);
	}

	// ---------------------------------------------------------------------------------------------------

	@Override
	public String toString() {
		return "(" + getLeft() + ", " + getRight() + ")";
	}

	// ---------------------------------------------------------------------------------------------------

	public static <K, V> ArrayList<K> getAllLefts(Iterable<Pair<K, V>> list) {
		ArrayList<K> result = new ArrayList<K>();
		for (Pair<K, V> pair : list)
			result.add(pair.getLeft());
		return result;
	}

	public static <K, V> ArrayList<V> getAllRights(Iterable<Pair<K, V>> list) {
		ArrayList<V> result = new ArrayList<V>();
		for (Pair<K, V> pair : list)
			result.add(pair.getRight());
		return result;
	}

	// ---------------------------------------------------------------------------------------------------

	public static <A extends Comparable<A>, B> Comparator<Pair<A, B>> comparatorOnLeft(Collection<Pair<A, B>> tupleCollection) {
		return new Comparator<Pair<A, B>>() {
			@Override
			public int compare(Pair<A, B> o1, Pair<A, B> o2) {
				return o1.getLeft().compareTo(o2.getLeft());
			}
		};
	}

	public static <A extends Comparable<A>, B> Comparator<Pair<A, B>> comparatorOnLeftRev(Collection<Pair<A, B>> tupleCollection) {
		return new Comparator<Pair<A, B>>() {
			@Override
			public int compare(Pair<A, B> o1, Pair<A, B> o2) {
				return -o1.getLeft().compareTo(o2.getLeft());
			}
		};
	}

	public static <A, B extends Comparable<B>> Comparator<Pair<A, B>> comparatorOnRight(Collection<Pair<A, B>> tupleCollection) {
		return new Comparator<Pair<A, B>>() {
			@Override
			public int compare(Pair<A, B> o1, Pair<A, B> o2) {
				return o1.getRight().compareTo(o2.getRight());
			}
		};
	}

	public static <A, B extends Comparable<B>> Comparator<Pair<A, B>> comparatorOnRightRev(Collection<Pair<A, B>> tupleCollection) {
		return new Comparator<Pair<A, B>>() {
			@Override
			public int compare(Pair<A, B> o1, Pair<A, B> o2) {
				return -o1.getRight().compareTo(o2.getRight());
			}
		};
	}

	static <A extends Comparable<A>, B> Comparator<Pair<A, B>> comparatorOnLeft(Collection<Pair<A, B>> tupleCollection,
			final boolean ascending) {
		return new Comparator<Pair<A, B>>() {
			final int weight = ascending ? 1 : -1;

			@Override
			public int compare(Pair<A, B> o1, Pair<A, B> o2) {
				return o1.getLeft().compareTo(o2.getLeft()) * weight;
			}
		};
	}

	static <A, B extends Comparable<B>> Comparator<Pair<A, B>> comparatorOnRight(Collection<Pair<A, B>> tupleCollection,
			final boolean ascending) {
		return new Comparator<Pair<A, B>>() {
			final int weight = ascending ? 1 : -1;

			@Override
			public int compare(Pair<A, B> o1, Pair<A, B> o2) {
				return o1.getRight().compareTo(o2.getRight()) * weight;
			}
		};
	}

	// ---------------------------------------------------------------------------------------------------

	/** Sort a List<Pair<K, V>> in-place into order of increasing or decreasing K */
	public static <K extends Comparable<K>, V> void sortPairsByLeft(List<Pair<K, V>> list, boolean ascending) {
		Collections.sort(list, comparatorOnLeft(list, ascending));
	}

	/** Sort a List<Pair<K, V>> in-place into order of increasing K */
	public static <K extends Comparable<K>, V> void sortPairsByLeft(List<Pair<K, V>> list) {
		Collections.sort(list, comparatorOnLeft(list, true));
	}

	/** Sort a List<Pair<K, V>> in-place into order of increasing or decreasing V */
	public static <K, V extends Comparable<V>> void sortPairsByRight(List<Pair<K, V>> list, boolean ascending) {
		Collections.sort(list, comparatorOnRight(list, ascending));
	}

	/** Sort a List<Pair<K, V>> in-place into order of increasing V */
	public static <K, V extends Comparable<V>> void sortPairsByRight(List<Pair<K, V>> list) {
		Collections.sort(list, comparatorOnRight(list));
	}

	/** Convert a <K, V> map into a list of Pair<K, V>, final order unspecified */
	public static <K, V> ArrayList<Pair<K, V>> mapToList(HashMap<K, V> map) {
		ArrayList<Pair<K, V>> list = new ArrayList<Pair<K, V>>();
		for (Entry<K, V> ent : map.entrySet())
			list.add(new Pair<K, V>(ent.getKey(), ent.getValue()));
		return list;
	}
}
