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

ll dp1[mn], psum[mn];
ll dp2[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];
		dp1[i] = 1e9;
	}

	for (int i = 1; i <= n; i++) {
		for (int j = max(i-h, 0); j == 0 || (j <= i-l) || (i == n && j < n); j++) {
			if (j < 0) continue;
			ll s = psum[i] - psum[j];
			dp1[i] = min(dp1[i], dp1[j] + (s >= 0));
			dp2[i] = max(dp2[i], dp2[j] + (s >= 0));
		}
	}

	cout << dp1[n] << ' ' << dp2[n] << endl;
}