#include <bits/stdc++.h>
using namespace std;

int n, l, r, a[45], ans = 0;

void dfs(int x, int res) {
    if (res >= l && res <= r) ans++;
    for (int i = x + 1; i <= n; i++) {
        int nowres = res + a[i];
        if (nowres > r) return ;
        dfs(i, nowres);
    }
    return ;
}

int main() {
    cin >> n >> l >> r;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++) {
        dfs(i, a[i]);
    }
    cout << ans << endl;
}