import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
import java.io.BufferedReader;
import java.io.FileReader;
import java.util.StringTokenizer;

/**
 *
 * @author Sreesasanka G
 */
public class Dancers {
    public static void main(String args[])throws Exception
    {
        BufferedReader in = new BufferedReader(new FileReader("B_Small.in"));
        int cases = Integer.parseInt(in.readLine());
        
        for(int i=0;i<cases;i++)
        {
            StringTokenizer st = new StringTokenizer(in.readLine()," ");
            int n = Integer.parseInt(st.nextToken());
            int s = Integer.parseInt(st.nextToken());
            int p = Integer.parseInt(st.nextToken());
            int[] a = new int[n];
            for(int j=0;j<n;j++)
            {
                a[j] = Integer.parseInt(st.nextToken());
            }
            System.out.println("Case #"+(i+1)+": "+maxPassers(n,s,p,a));
        }
    }
    public static int maxPassers(int n,int s,int p,int a[])
    {
        int count=0,help=0;
        for(int i=0;i<n;i++)
        {
            int quotient = a[i]/3;
            int remainder = a[i]%3;
            if(quotient >= p||((quotient == p-1&& remainder >=2)||(quotient == p-1&& remainder >=1)&&p-1>0))
            {
                count++;
            }
            else if(((quotient == p-1&& remainder >=0)&&p-1>0)||((quotient == p-2&& remainder >=2)&&p-2>=0))
            {
                help++;
            }
        }
        if(help>=s)
        {
            count += s;
        }
        else
        {
            count += help;
        }
        return count;
    }
}