You have n problems. You have estimated the difficulty of the i-th one as integer ci. Now you want to prepare a problemset for a contest, using some of the problems you've made.

A problemset for the contest must consist of at least two problems. You think that the total difficulty of the problems of the contest must be at least l and at most r. Also, you think that the difference between difficulties of the easiest and the hardest of the chosen problems must be at least x.

Find the number of ways to choose a problemset for the contest.

Input

The first line contains four integers n, l, r, x (1 ≤ n ≤ 15, 1 ≤ l ≤ r ≤ 109, 1 ≤ x ≤ 106) — the number of problems you have, the minimum and maximum value of total difficulty of the problemset and the minimum difference in difficulty between the hardest problem in the pack and the easiest one, respectively.

The second line contains n integers c1, c2, ..., cn (1 ≤ ci ≤ 106) — the difficulty of each problem.

Output

Print the number of ways to choose a suitable problemset for the contest. 

Examples

Input

3 5 6 1
1 2 3


Output

2


Input

4 40 50 10
10 20 30 25


Output

2


Input

5 25 35 10
10 10 20 10 20


Output

6

Note

In the first example two sets are suitable, one consisting of the second and third problem, another one consisting of all three problems.

In the second example, two sets of problems are suitable — the set of problems with difficulties 10 and 30 as well as the set of problems with difficulties 20 and 30.

In the third example any set consisting of one problem of difficulty 10 and one problem of difficulty 20 is suitable.

/*
 -> Written by <-
   -----------
  |J_O_B_E_E_L|
  |___________|
  |    ___    |
  |   (^_^)   |
  |  /( | )\  |
  |____|_|____|
*/
import java.lang.reflect.Array;
import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
import java.util.Map.*;

public class Test {
    static  PrintWriter pw=new PrintWriter(System.out);
    public static void main(String[] args) throws IOException, InterruptedException {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt(); int l=sc.nextInt(); int right=sc.nextInt(); int x=sc.nextInt();
        int [] arr=sc.nextIntArray(n);
        int count=0;
        for (int mask=0;mask<1<<n;mask++){
            int min=(int)2e9,max=0,sum=0;
            for(int i=0;i<n;i++)
                if((mask & 1<<i)!=0){
                    sum+=arr[i]; max=Math.max(max,arr[i]); min=Math.min(min,arr[i]);
                }
           // pw.println(sum);
            if(sum>= l && sum<=right &&  max-min>=x) count++;
        }
        pw.println(count);
        pw.flush();
        pw.close();
    }


    static class Scanner
    {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

        public String next() throws IOException
        {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        public int nextInt() throws IOException {return Integer.parseInt(next());}

        public long nextLong() throws IOException {return Long.parseLong(next());}

        public String nextLine() throws IOException {return br.readLine();}

        public double nextDouble() throws IOException
        {
            String x = next();
            StringBuilder sb = new StringBuilder("0");
            double res = 0, f = 1;
            boolean dec = false, neg = false;
            int start = 0;
            if(x.charAt(0) == '-')
            {
                neg = true;
                start++;
            }
            for(int i = start; i < x.length(); i++)
                if(x.charAt(i) == '.')
                {
                    res = Long.parseLong(sb.toString());
                    sb = new StringBuilder("0");
                    dec = true;
                }
                else
                {
                    sb.append(x.charAt(i));
                    if(dec)
                        f *= 10;
                }
            res += Long.parseLong(sb.toString()) / f;
            return res * (neg?-1:1);
        }
        public int [] nextIntArray(int x) throws IOException {
            int [] arr=new int [x];
            for(int i=0;i<x;i++) arr[i]=nextInt();
            return  arr;
        }
        public long [] nextLongArray(int x) throws IOException {
            long [] arr=new long [x];
            for(int i=0;i<x;i++) arr[i]=nextLong();
            return  arr;
        }
        public boolean ready() throws IOException {return br.ready();}


    }

    static class pair implements Comparable<pair> {
        String name;
        int x, y, z;

        public pair(int x, int y) {
            this.x = x;
            this.y = y;
        }

        public int compareTo(pair o) {
            if (x != o.x)
                return x - o.x;
            return y - o.y;
        }

        public String toString() {
            return x + " " + y;
        }
    }
    static int min(int x, int y, int z) {
        return Math.min(Math.min(x, y), z);
    }

    static long min(long x, long y, long z) {
        return Math.min(Math.min(x, y), z);
    }

    static int max(int x, int y, int z) {
        return Math.max(Math.max(x, y), z);
    }

    static long max(long x, long y, long z) {
        return Math.max(Math.max(x, y), z);
    }



}