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

}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package codejam;

/**
 * @(#)codejam2.java
 *
 * codejam2 application
 *
 * @author 
 * @version 1.00 2012/4/14
 */
 import java.util.Scanner;
import java.io.*;
import java.util.StringTokenizer;
public class codejam2012B {
    
    public static void main(String[] args) throws IOException {
    	Scanner scan = new Scanner(new File("C:\\Users\\Eren\\Desktop\\input.txt"));
    //	System.out.println(scan.nextLine());
    	int N = Integer.parseInt(scan.nextLine());
    	String line;
    	int count;
    	int result;
    	int surprise;
    	int p;
    	int temp;
    	int temp1;
    	StringTokenizer tokenizer;
    	
    	for ( int i = 0 ; i < N ; i ++)	{
    		result = 0;
    		line = scan.nextLine();
    		tokenizer = new StringTokenizer(line);
    		count = Integer.parseInt(tokenizer.nextToken());
    		surprise = Integer.parseInt(tokenizer.nextToken());
    		p = Integer.parseInt(tokenizer.nextToken());
    		
    		for ( int j = 0; j < count; j++)
    		{
    			temp = Integer.parseInt(tokenizer.nextToken());
    			temp1 = temp;
    			temp = 3*p -temp;
    			if (temp1 == 0 )  
                        {
                            if ( p == 0)
    				result++;   
                        }
    			else if ( temp1 == 1 )
                        {
                                if(p == 0 || p == 1)
                                    result++;
                        }
    			else if ( temp <= 2 )
    				result++;
    			else if ( (temp == 4 || temp == 3) && surprise > 0 )
    				{
    				result++;
    				surprise--;
    				}
    				
    		}		
    		System.out.println("Case #" + (i+1) + ": " + result);			
    	}
    }
}
