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.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.util.Scanner;

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

/**
 *
 * @author Akash Agrawal
 */
public class DWG {
    
    public static void main(String [] args) throws FileNotFoundException, IOException
    {
        Scanner scan= new Scanner(new File("inp.txt"));
        
        int n=scan.nextInt();
        //System.out.println(n);
        int cas=1;
        while(n--!=0)
        {
            int t=scan.nextInt();
            int s=scan.nextInt();
            int p=3*scan.nextInt();
            
            int count =0;
            for(int i=0;i<t;i++)
            {
                int temp = scan.nextInt();
                //System.out.println(temp);
                if(temp == 0 )continue;
                else if(temp==1 && p==1) count++; 
                if(temp>=p-2)count++;
                else if(temp>=p-4 && s>0 )
                {count++;s--;}
                
            }
            
            System.out.println("Case #"+cas+++": "+count);
            
        }
        }
    
}
