#include <iostream>
#include <vector>
#include <climits>

using namespace std;

pair<int, int> count_profitable_segments(const vector<int>& profits, int min_segment_size, int max_segment_size) {
    int n = profits.size();
    int min_profitable_segments = INT_MAX;
    int max_profitable_segments = 0;

    for (int segment_size = min_segment_size; segment_size <= max_segment_size; segment_size++) {
        for (int start_day = 0; start_day <= n - segment_size; start_day++) {
            int total_profit = 0;
            for (int i = start_day; i < start_day + segment_size; i++) {
                total_profit += profits[i];
            }
            if (total_profit > 0) {
                min_profitable_segments = min(min_profitable_segments, n / segment_size);
                max_profitable_segments = max(max_profitable_segments, (n + segment_size - 1) / segment_size);
            }
        }
    }

    return {min_profitable_segments, max_profitable_segments};
}

int main() {
    int n, min_segment_size, max_segment_size;
    cin >> n >> min_segment_size >> max_segment_size;

    vector<int> profits(n);
    for (int i = 0; i < n; i++) {
        cin >> profits[i];
    }

    pair<int, int> result = count_profitable_segments(profits, min_segment_size, max_segment_size);
    cout << result.first << " " << result.second << endl;

    return 0;
}