#include<bits/stdc++.h>
using namespace std;
#define int long long int
// ============================================================================================================
int subset(int *arr, int i, int size) {
int sum = 0;
size -= 1;
while (i) {
if (i & 1) {
sum += arr[size];
}
size--;
i = i >> 1;
}
return sum;
}
int32_t main() {
int n, a, b, val;
cin >> n >> a >> b;
int arr[n];
for(int i = 0;i<n;++i) {
cin >> arr[i];
}
int range = 1 << n;
int count = 0;
for(int i = 1;i<range;++i) {
val = subset(arr, i, n);
if (( val >= a) && (val <= b)) {
count++;
}
}
if ((a <= 0) && (b >= 0)) {
count++;
}
cout << count;
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KIAp1c2luZyBuYW1lc3BhY2Ugc3RkOwojZGVmaW5lIGludCAgICBsb25nIGxvbmcgaW50CiAKLy8gPT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09CiAKIAppbnQgc3Vic2V0KGludCAqYXJyLCBpbnQgaSwgaW50IHNpemUpIHsKCWludCBzdW0gPSAwOwoJc2l6ZSAtPSAxOwoJd2hpbGUgKGkpIHsKCQlpZiAoaSAmIDEpIHsKCQkJc3VtICs9IGFycltzaXplXTsKCQl9CgkJc2l6ZS0tOwoJCWkgPSBpID4+IDE7Cgl9CglyZXR1cm4gc3VtOwogCn0KIAogCmludDMyX3QgbWFpbigpIHsKIAoJaW50IG4sIGEsIGIsIHZhbDsKCWNpbiA+PiBuID4+IGEgPj4gYjsKCWludCBhcnJbbl07Cglmb3IoaW50IGkgPSAwO2k8bjsrK2kpIHsKCQljaW4gPj4gYXJyW2ldOwoJfQoJaW50IHJhbmdlID0gMSA8PCBuOwoJaW50IGNvdW50ID0gMDsKCWZvcihpbnQgaSA9IDE7aTxyYW5nZTsrK2kpIHsKCQl2YWwgPSBzdWJzZXQoYXJyLCBpLCBuKTsKCQlpZiAoKCB2YWwgPj0gYSkgJiYgKHZhbCA8PSBiKSkgewoJCQljb3VudCsrOwoJCX0KCX0KCWlmICgoYSA8PSAwKSAmJiAoYiA+PSAwKSkgewoJCWNvdW50Kys7Cgl9Cgljb3V0IDw8IGNvdW50OwoJcmV0dXJuIDA7Cn0KIA==