// 長い夜の終わりを信じながら
// Think twice, code once.
#include <queue>
#include <vector>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define eputchar(c) putc(c, stderr)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define eputs(str) fputs(str, stderr), putc('\n', stderr)
using namespace std;

int n, l, r, a[105];
priority_queue<int, vector<int>, greater<>> q;
long long ans = 0x3f3f3f3f3f3f3f3f;

int main() {
	scanf("%d%d%d", &n, &l, &r);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	for (int i = 1; i <= n - 1; i++) {
		int num = (n - 1) / i, cnt = (n - 1) % i;
		while (!q.empty()) q.pop();
		for (int j = 1; j <= n; j++) q.emplace(a[j]);
		int flag = 1;
		long long res = 0;
		for (int j = 1; j <= cnt; j++) {
			flag &= l <= num + 2 && num + 2 <= r;
			int sum = 0;
			for (int k = 1; k <= num + 2; k++) sum += q.top(), q.pop();
			res += sum;
			q.push(sum);
		}
		for (int j = 1; j <= i - cnt; j++) {
			flag &= l <= num + 1 && num + 1 <= r;
			int sum = 0;
			for (int k = 1; k <= num + 1; k++) sum += q.top(), q.pop();
			res += sum;
			q.push(sum);
		}
		if (flag) ans = min(ans, res);
	}
	printf("%lld\n", ans != 0x3f3f3f3f3f3f3f3f ? ans : 0ll);
	return 0;
}