package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

/*
 * 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("**************");
            //

        }
     
        
        
    }
    
    
    
}
