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

#define endl '\n'

#define maxn 105

int a[maxn], op[maxn];

void solve(void) {
    int n, L, R;
    cin >> n >> L >> R;
    for (int i = 1; i <= n; i++) cin >> a[i];
    int64_t ans = INT64_MAX;
    for (int len = 1; len * (L - 1) <= n - 1; len++) {
        if (len * (R - 1) < n - 1) continue;
    
        int rest = n - 1;
        for (int i = 1; i <= len; i++) op[i] = L, rest -= L - 1;
        for (int i = len; i; i--) op[i] += min(R - L, rest), rest -= min(R - L, rest);

        priority_queue<int, vector<int>, greater<int>> que;
        int64_t tot = 0;
        for (int i = 1; i <= n; i++) que.push(a[i]);
        for (int i = 1; i <= len; i++) {
            int sum = 0;
            while (op[i]--) sum += que.top(), que.pop();
            tot += sum, que.push(sum);
        }
        ans = min(ans, tot);
    }
    cout << (ans == INT64_MAX ? 0 : ans) << endl;
    return;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);

    int _ = 1;
    while (_--) solve();

    return 0;
}