#include<bits/stdc++.h>
#define ll long long 
#define pb push_back
#define pii pair<int,int>
using namespace std;
const ll N = 1e9;
const ll mod = 998244353;
ll sum = 0;
int n, l, r;
void solve()
{
    ll a[n];
    for(int i=0; i<n; i++) cin >> a[i];
    sort(a,a+n);
    ll sum[n] = {0};
    sum[0] = a[0];
    for(int i=1; i<n; i++)
    {
        sum[i] = sum[i-1] + a[i]; 
    }
    
    ll dp[n];
    l = l-1;
    r = r-1;
    for(int i=0; i<=r; i++)
    {
        if(i < l) dp[i] = 0;
        else dp[i] = sum[i];
    }

    for(int i=r+1; i<n; i++)
    {
        int k = i - r;
        while(dp[k] == 0 && k <= i - l)
        {
            k++;
        }
        if(k <= i-l) dp[i] = dp[k] + sum[i];
        else dp[i] = 0;
    }


    cout << dp[n-1] << endl;
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> l >> r;
    solve();
}