#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int N = 1 << 15;

int a[N];
int pref[N];

int getSum(int l, int r) {
	return pref[r] - (l == 0 ? 0 : pref[l - 1]);
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, l, h;
	cin >> n >> l >> h;
	FOR(i, 0, n) {
		cin >> a[i];
		pref[i] = (i > 0 ? pref[i - 1] : 0) + a[i];
	}
	int mn = INT_MAX, mx = INT_MIN;
	FOR(len, l, h + 1) {
		for (int i = 0; i < len; i++) {
			int c = 0;
			if (i > 0 && pref[i - 1] > 0) {
				c++;
			}
			for (int j = i; j < n; j += len) {
				if (getSum(j, min(n, j + len) - 1) > 0) {
					c++;
				}
			}
			mn = min(mn, c);
			mx = max(mx, c);
		}
	}
	cout << mn << " " << mx << "\n";
	return 0;
}