You are policeman and you are playing a game with Slavik. The game is turn-based and each turn consists of two phases. During the first phase you make your move and during the second phase Slavik makes his move.

There are n doors, the i-th door initially has durability equal to a_i.

During your move you can try to break one of the doors. If you choose door i and its current durability is b_i then you reduce its durability to max(0, b_i - x) (the value x is given).

During Slavik's move he tries to repair one of the doors. If he chooses door i and its current durability is b_i then he increases its durability to b_i + y (the value y is given). Slavik cannot repair doors with current durability equal to 0.

The game lasts 10^{100} turns. If some player cannot make his move then he has to skip it.

Your goal is to maximize the number of doors with durability equal to 0 at the end of the game. You can assume that Slavik wants to minimize the number of such doors. What is the number of such doors in the end if you both play optimally?

Input

The first line of the input contains three integers n, x and y (1 ≤ n ≤ 100, 1 ≤ x, y ≤ 10^5) — the number of doors, value x and value y, respectively.

The second line of the input contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^5), where a_i is the initial durability of the i-th door.

Output

Print one integer — the number of doors with durability equal to 0 at the end of the game, if you and Slavik both play optimally.

Examples

Input


6 3 2
2 3 1 3 4 2


Output


6


Input


5 3 3
1 2 4 2 3


Output


2


Input


5 5 6
1 2 6 10 3


Output


2

Note

Clarifications about the optimal strategy will be ignored.


//
//import javax.print.DocFlavor;
//import javax.swing.*;
//import javax.swing.text.StyleContext;
//import java.awt.image.AreaAveragingScaleFilter;
import javax.print.attribute.Attribute;
import javax.print.attribute.HashAttributeSet;
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.nio.channels.AcceptPendingException;
import java.nio.charset.IllegalCharsetNameException;
import java.util.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.util.Collections;
import java.io.InputStreamReader;
import java.util.logging.SimpleFormatter;


public   class Main{





    public static void main(String[] args) {

        try {
            PrintWriter fop = new PrintWriter(System.out);
            FastScanner fsca = new FastScanner();

            int n = fsca.nextInt();
            int x = fsca.nextInt();
            int y = fsca.nextInt();

            int A[] = fsca.readArray(n) ;
            if (x > y){
                System.out.println(n);
                return;
            }
            Arrays.sort(A);
            int ct = 0 ;
            for (int i = 0; i <n ; i++) {
                if (A[i] > x)
                    break;
                ct++ ;
            }

            fop.println((int) Math.ceil((double)ct/(double) 2)  );














//        int tree[] = new int[4*n+1] ;
//        BuiltTree(A , 0 , n-1 , tree , 1);
//        int lazy[] = new int[4*n + 1] ;
//
//        updateRangeLazy(tree , lazy , 0 , n-1 , 0 , 2 , 10 , 1);
//        updateRangeLazy(tree , lazy , 0 , n-1 , 0 , 4 , 10 , 1);
//
//        fop.println(querylazy(tree , lazy , 0 , n-1 , 1 ,1 ,1));
//
//        updateRangeLazy(tree, lazy , 0 , n-1 , 10 , 4 , 3 ,1);
//        fop.println(querylazy(tree , lazy , 0 , n-1 , 3 , 5 , 1 ));


            fop.flush();
            fop.close();

        }
        catch (Exception e){
            return;
        }



    }
    /*-----------------------------------------------------------------------------------------------------------------------------------------------*/

    // segment tree


    //  BuiltTree(A , 0 , n-1 , tree , 1);
    static void BuiltTree(int A[] , int s , int e , int tree[] , int index){
        if (s== e) {
            tree[index] = A[s] ;
            return;
        }

        int mid = (s+e)/2;
        BuiltTree(A , s , mid , tree , 2*index);
        BuiltTree(A , mid+1 , e , tree , 2*index+1);
        tree[index] = Math.min( tree[2*index], tree[2*index+1] ) ;
        return;

    }

    static int query(int tree[] , int ss , int se , int qs , int qe , int index){

        // complete overlap
        if (ss >= qs && se <= qe)
            return  tree[index];

        //no overlap
        if (qe < ss || qs > se)
            return Integer.MAX_VALUE ;

        // partial overlap
        int mid = (ss+se)/2 ;
        int left = query(tree , ss , mid , qs, qe , 2*index) ;
        int right = query(tree , mid+1 , se , qs, qe , 2*index+1) ;
        return Math.min(left , right) ;
    }


   static void update(int tree[] , int ss , int se , int i , int increment , int index){
        // i is the index of which we want to update the value

        if (i > se || i<ss)
            return;

        if (ss == se){
              tree[index] += increment ;
            return;
        }
        int mid = (ss+se)/2 ;
        update(tree , ss , mid , i , increment , 2*index);
        update(tree , mid+1 , se , i , increment , 2*index+1);
        tree[index]  = Math.min(tree[2*index], tree[2*index+1] ) ;

    }

    static  void updateRange(int tree[] , int ss , int se , int l , int r , int inc , int index){

        if (l > se || r< ss)
            return;

        if (ss == se){
            tree[index] += inc ;
             return;
        }

        int mid = (ss+se)/2 ;
        updateRange(tree , ss , mid , l , r , inc , 2*index);
        updateRange(tree , mid+1 , se , l , r , inc , 2*index + 1);

        tree[index] = Math.min( tree[2*index], tree[2*index + 1] ) ;
        return;


    }
    // Lazy rnage Update

    static void updateRangeLazy(int tree[] , int lazy[] , int ss ,int se , int l , int r , int increment , int index){

        if (lazy[index] != 0 ){
            tree[index] += lazy[index];

            if (ss != se){
                lazy[2*index]  +=  lazy[index];
                lazy[2*index + 1]  +=  lazy[index];
            }
            lazy[index ] = 0 ;
        }

        if (ss > r && se< l )
            return;

        if (ss >= l && se <= r) {
            tree[index] += increment;


            if (ss != se) {
                lazy[2 * index] += increment;
                lazy[2 * index + 1] += increment;
            }
            return;
        }

        int mid = (ss + se)/2 ;
        updateRange(tree , ss , mid , l , r , increment , 2*index);
        updateRange(tree , mid + 1 , se , l , r , increment , 2*index + 1);

        tree[index] =  Math.min( tree[2*index], tree[2*index + 1] ) ;

    }

    // min lazy query

    static int querylazy(int tree[] , int lazy[] , int ss , int se , int qs , int qe , int index) {

        if (lazy[index] != 0) {

            tree[index] += lazy[index];
            if (ss != se) {
                lazy[2 * index] += lazy[index];
                lazy[2 * index + 1] += lazy[index];
            }
            lazy[index] = 0;
        }

        if (ss > qe || se < qs)
            return Integer.MAX_VALUE;

        if (ss >= qs && se <= qe)
            return tree[index];

        int mid = (ss + se) / 2;
        int left = querylazy(tree, lazy, ss, mid, qs, qe, 2 * index);
        int right = querylazy(tree, lazy, mid + 1, se, qs, qe, 2 * index + 1);

        return Math.min(left, right);

    }





/*-----------------------------------------------------------------------------------------------------------------------------------------------------------*/
    static boolean isEven(int a){
        if (a%2 == 0)
            return true ;
        else return false ;
    }
    static boolean isEvenLong(long a){
        if (a%2 == 0)
            return true ;
        else return false ;
    }

    static void sieve(int n){
        boolean[] flag = new boolean[n] ;

        for (int i=2 ; i*i<n ; i++){
            if (flag[i])
                continue;
            else
                for (int j= i*i ; j<=n ; j+= i){
                    flag[j] = true;
                }
        }


    }
    static int gcd(int a , int b){
        if (b > a){
            int tenp = b ;
            b = a ;
            a = tenp ;
        }
        int temp = 0 ;
        while (b != 0){
            a %= b ;
            temp = b ;
            b = a ;
            a = temp ;
        }
        return a ;
    }

    static long gcd1( long a , long b){
        if (b > a){
            long tenp = b ;
            b = a ;
            a = tenp ;
        }
        long temp = 0 ;
        while (b != 0){
            a %= b ;
            temp = b ;
            b = a ;
            a = temp ;
        }
        return a ;
    }






    static final Random random=new Random();

    static void ruffleSort(int[] a) {
        int n=a.length;//shuffle, then sort
        for (int i=0; i<n; i++) {
            int oi=random.nextInt(n), temp=a[oi];
            a[oi]=a[i]; a[i]=temp;
        }
        Arrays.sort(a);
    }




    static class FastScanner {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer("");
        String next() {
            while (!st.hasMoreTokens())
                try {
                    st=new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }
        int[] readArray(int n) {
            int[] a=new int[n];
            for (int i=0; i<n; i++) a[i]=nextInt();
            return a;
        }
        long[] readLongArray(int n){
            long[] a = new long[n];
            for (int i=0 ; i<n ; i++)
                a[i] = nextLong() ;
            return a ;
        }
        long nextLong() {
            return Long.parseLong(next());
        }
    }






}


