#include <bits/stdc++.h>
 
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
#define for1(i, n) for (int i = 1; i < (int)(n); i++)
#define fore(i, l, r) for (int i = (int)(l); i <= (int)(r); i++)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef set<int> si;
typedef pair<int, int> pii;
typedef set<pii> spii;

int n, m, M;
int a[20000];

int main() {
	ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> m >> M;
    ll res = 0;
    int tmp;
    forn(i, n) {
    	cin >> tmp;
		a[i] = tmp;
    	if (tmp >= m && tmp <= M) ++res;
	}
	ll sum;
    forn(i, n) {
    	sum = a[i];
    	for (int j = i + 1; j < n; ++j) {
    		sum += a[j];
    		if (sum >= m && sum <= M) ++res;
    	}
    }

    cout << res;

	return 0;
}