#include <bits/stdc++.h>

using namespace std;

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

void dfs(int u, int sum)
{
	if (u > n)
	{
		if (sum >= l && sum <= r)
			++ans;
		return;
	}
	if (sum < l && sum + a[u] <= r)
		dfs(u + 1, sum + a[u]);
	dfs(u + 1, sum);
}

int main()
{
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	cin >> n >> l >> r;
	for (int i = 1; i <= n; ++i)
		cin >> a[i];
	dfs(1, 0);
	cout << ans << endl;
	return 0;
}