import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

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

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;
import java.util.Set;

/**
 *
 * @author daniele
 */
public class GCJ_B {
    
    
    static private class Cp{
        public int p;
        public Boolean s;
        
        public  Cp(int a, Boolean b){p=a; s=b;}
        
        public String toString(){
         return p+","+s;
        }
        
    }
    
    public static void main(String[] args) throws Exception{
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        
        int n,p,s;
        int countp=0,counts=0;
        int prove=in.nextInt();
        ArrayList<Integer> tp;
        
        
        
        
        //ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            out.append("Case #" +i+": ");out.flush();
            n=in.nextInt();
            s=in.nextInt();
            p=in.nextInt();
            tp= new ArrayList<Integer>();
            for(int j=0;j<n;j++)
                tp.add(in.nextInt());
            
            for(int j=0;j<tp.size();j++){
                int f=tp.get(j)-p;
                if( f>=0 && f/2>=p-2){
                    countp++;
                    if( f/2==p-2 && s==0 )
                      countp--;
                    else if(f/2==p-2 && s>0)
                        s--; 
                }
                
            }
            System.out.println("countp="+countp+" counts="+counts+" s="+s);
            //if((counts - s)>0)
            //    countp= countp - (counts - s);
            out.append(countp+"\n");out.flush();
            countp=0; counts=0;
            System.out.println("**************");
            //

        }
     
        
        
    }
    
    
    
}
