#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const ll mn = 3e4+5;

ll psum[mn];
int main() {
	int n, l, h; cin >> n >> l >> h;
	for (int i = 1; i <= n; i++) {
		cin >> psum[i];
		psum[i] += psum[i-1];
	}

	int lo = 1e9, hi = 0;
	for (int step = l; step <= h; step++) {
		for (int start = 1; start <= step; start++) {
			int cnt = 0;
			for (int cur = start-step; cur < n; cur += step) {
				cnt += (psum[min(cur+step, n)] - psum[max(cur, 0)]) > 0;
			}
			lo = min(lo, cnt);
			hi = max(hi, cnt);
		}
	}

	cout << lo << ' ' << hi << endl;
}