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.InputStreamReader;

/**
 *
 * @author andy
 */
public class DancingWithGooglers {

    public static void main(String[] args) throws Exception {
        
        //char sd = '1';
        //int[] sdf = new int[ 10 ];
        
        //System.out.println( Math.ceil( 17 / 3.0 ) );
        
        String map = "yhesocvxduiglbkrztnwjpfmaq";
        
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); 
        
        String s = in.readLine();
        
        int numTestCases = Integer.parseInt(s);
        
        for( int testCase = 1 ; testCase <= numTestCases ; testCase ++ )
        {
            String strCase = in.readLine();
            
            String[] arrCase = strCase.split(" ");
            
            int count = 0;
            
            int numDancers = Integer.parseInt( arrCase[ 0 ] );
            int numSurprises = Integer.parseInt( arrCase[ 1 ] );
            int cutoff = Integer.parseInt( arrCase[ 2 ] );
            
            for( int i = 0 ; i < numDancers ; i ++ )
            {
                int score = Integer.parseInt(arrCase[ i + 3 ]);
                
                int modThree = score % 3;
                
                int divThree = score / 3;
                
                if( modThree > 0 ) divThree ++;
                
                if( divThree >= cutoff )
                {
                    count ++;
                }else if( numSurprises > 0 && (modThree == 0 || modThree == 2) && divThree > 1 && divThree + 1 >= cutoff)
                {
                    numSurprises --;
                    count ++;
                }
                
            }
            
            System.out.println("Case #" + testCase + ": " + count);
            
        }
    }
}