#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 5;
int n, l, r, a[MAXN], cnt = 0, ans = 0, sum[MAXN];

int main () {
    freopen ("bjoi2016_hzss.in", "r", stdin);
    freopen ("bjoi2016_hzss.out", "w", stdout);
    scanf ("%d %d %d", &n, &l, &r);
    sum[0] = 0;
    for (int q = 1; q <= n; ++q) {
        scanf ("%d", &a[q]);
        sum[q] = sum[q - 1] + a[q];
    }
    for (int q = 1; q <= n; ++q) {
        for (int w = q; w <= n; ++w) {
            if (sum[w] - sum[q - 1] >= l && sum[w] - sum[q - 1] <= r) {
                ans ++;
            }
        }
    }
//    int i = 1, j;
//    while (i <= n) {
//        i ++;
//    }
//    
    printf ("%d\n", ans);
    return 0;
}