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 qualifiers12.b;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Set;
import java.util.StringTokenizer;

public class Dancing {

    public static Set<Triple>[] combs;

    public static class Triple {
	protected final int total;
	protected final int v1;
	protected final int v2;
	protected final int v3;

	public Triple(int total, int v1, int v2, int v3) {
	    this.total = total;
	    this.v1 = v1;
	    this.v2 = v2;
	    this.v3 = v3;
	}

	public int getMax() {
	    return max2(max2(v1, v2), v3);
	}

	private int max2(int n1, int n2) {
	    return (n1 > n2) ? n1 : n2;
	}

	public int getTotal() {
	    return v1 + v2 + v3;
	}

	public boolean isTriplet() {
	    if (v1 < 0 || v2 < 0 || v3 < 0) {
		return false;
	    }
	    if (Math.abs(v1 - v2) > 2 || Math.abs(v1 - v3) > 2 || Math.abs(v2 - v3) > 2) {
		return false;
	    }
	    return v1 + v2 + v3 == total;
	}

	public boolean isSurprising() {
	    return Math.abs(v1 - v2) == 2 || Math.abs(v1 - v3) == 2 || Math.abs(v2 - v3) == 2;
	}

	@Override
	public String toString() {
	    return total + "(" + v1 + "," + v2 + "," + v3 + ")";
	}

	@Override
	public int hashCode() {
	    List<Integer> list = new ArrayList<Integer>();
	    list.add(v1);
	    list.add(v2);
	    list.add(v3);
	    Collections.sort(list);
	    return list.get(0) * 100 + list.get(1) * 10 + list.get(2);
	}

	@Override
	public boolean equals(Object obj) {
	    if (obj instanceof Triple) {
		Triple that = (Triple) obj;
		if ((this.v1 == that.v1 || this.v1 == that.v2 || this.v1 == that.v3)
			&& (this.v2 == that.v1 || this.v2 == that.v2 || this.v2 == that.v3)
			&& (this.v3 == that.v1 || this.v3 == that.v2 || this.v3 == that.v3)) {
		    return true;
		} else {
		    return false;
		}
	    } else {
		return false;
	    }
	}
    }

    public static void computeCombination(int k, int total) {
	int avgPart = Math.round((total + 0.0f) / 3.0f);
	for (int i = -1; i < 2; i++) {
	    computeCombinationGiven(k, total, avgPart + i);
	}
    }

    private static void computeCombinationGiven(int k, int total, int part) {
	int missing = total - part;
	int avgPart = Math.round((missing + 0.0f) / 2.0f);

	for (int i = -1; i < 2; i++) {
	    computeWithOne(k, total, part, avgPart + i, avgPart);
	}
    }

    private static void computeWithOne(int k, int total, int part1, int part2, int lastAvg) {
	for (int i = -1; i < 2; i++) {
	    Triple triple = new Triple(total, part1, part2, lastAvg + i);
	    if (triple.isTriplet()) {
		combs[k].add(triple);
	    }
	}
    }

    public static void main(String[] args) throws IOException {

	BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
	String s = in.readLine();

	int cases = Integer.parseInt(s);

	for (int i = 0; i < cases; i++) {
	    s = in.readLine();
	    StringTokenizer tokenizer = new StringTokenizer(s, " ");

	    int[] totals = new int[Integer.parseInt(tokenizer.nextToken())];
	    combs = new Set[totals.length];
	    for (int k = 0; k < combs.length; k++) {
		combs[k] = new HashSet<Triple>();
	    }
	    int surprising = Integer.parseInt(tokenizer.nextToken());
	    int p = Integer.parseInt(tokenizer.nextToken());

	    int k = 0;
	    while (tokenizer.hasMoreTokens()) {
		totals[k] = Integer.parseInt(tokenizer.nextToken());
		computeCombination(k, totals[k]);
		k++;
	    }

	    // for (k = 0; k < combs.length; k++) {
	    //
	    // String tmp = "";
	    // for (Triple triple : combs[k]) {
	    // tmp += triple.toString() + " ";
	    // }
	    // System.out.println(tmp);
	    //
	    // }

	    int usedSurprising = 0;
	    for (k = 0; k < combs.length; k++) {

		if (containsSurprisingSequence(combs[k])) {
		    Triple triple = containsNonSurprisingAboveOrEqualP(combs[k], p);
		    if (triple != null) {
			combs[k].clear();
			combs[k].add(triple);
		    } else if (usedSurprising < surprising) {
			triple = containsSurprisingAboveOrEqualP(combs[k], p);
			if (triple != null) {
			    combs[k].clear();
			    combs[k].add(triple);
			    usedSurprising++;
			}
		    } else {
			Iterator<Triple> iter = combs[k].iterator();
			while (iter.hasNext()) {
			    triple = iter.next();
			    if (triple.isSurprising()) {
				continue;
			    }
			    combs[k].clear();
			    combs[k].add(triple);
			    break;
			}
		    }
		} else {
		    // choose one above P, otherwise random one
		    Triple triple = containsNonSurprisingAboveOrEqualP(combs[k], p);
		    if (triple != null) {
			combs[k].clear();
			combs[k].add(triple);
		    } else {
			Iterator<Triple> iter = combs[k].iterator();
			while (iter.hasNext()) {
			    triple = iter.next();
			    if (triple.isSurprising()) {
				continue;
			    }
			    combs[k].clear();
			    combs[k].add(triple);
			    break;
			}
		    }
		}
	    }

	    int res = 0;
	    for (k = 0; k < combs.length; k++) {
		for (Triple triple : combs[k]) {
		    if (triple.getMax() >= p) {
			res++;
		    }
		}
	    }

	    String result = "Case #" + (i + 1) + ": " + res;
	    System.out.println(result);
	}

    }

    private static boolean containsSurprisingSequence(Set<Triple> triples) {
	for (Triple triple : triples) {
	    if (triple.isSurprising()) {
		return true;
	    }
	}
	return false;
    }

    private static Triple containsSurprisingAboveOrEqualP(Set<Triple> triples, int p) {
	for (Triple triple : triples) {
	    if (triple.isSurprising()) {
		if (triple.getMax() >= p) {
		    return triple;
		}
	    }
	}
	return null;
    }

    private static Triple containsNonSurprisingAboveOrEqualP(Set<Triple> triples, int p) {
	for (Triple triple : triples) {
	    if (!triple.isSurprising()) {
		if (triple.getMax() >= p) {
		    return triple;
		}
	    }
	}
	return null;
    }
}
