#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

#define fastIO ios_base::sync_with_stdio(false);cin.tie(0)
#define N 100000
#define mod0 1000000007
#define INF 1e9
#define pb push_back
#define popb pop_back
#define endl '\n'
#define ll long long
#define ld long double
#define loop(i,x,y) for(ll i=x;i<y;i++)

using namespace std;

int n , a , b , c[N];

void init()
{
	cin >> n >> a >> b;
	loop(i , 0 , n) {
		cin >> c[i];
	}
}

void solve()
{
	queue<int> q;
	while ( !q.empty() ) q.pop();
	ld sum = 0;
	int ans = 0;
	loop(i , 0 , n) {
		sum += c[i];
		q.push(c[i]);
		while ( sum / q.size() < a || sum / q.size() > b ) {
			sum -= q.front();
			q.pop();
		}
		ans++;
	}
	cout << ans << endl;
}

int main()
{
	fastIO;
	init();
	solve();
	return 0;
}