#include<bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);i--)
#define wln putchar('\n')
template<class T1,class T2> void chkmin(T1 &x,T2 y){if(y<x)x=y;}
template<class T1,class T2> void chkmax(T1 &x,T2 y){if(y>x)x=y;}
const int N=105,INF=1000000007;
int n,l,r,a[N],s[N];
int f[N][N][N],g[N];
int main()
{
    scanf("%d%d%d",&n,&l,&r);
    For(i,1,n)scanf("%d",a+i);
    sort(a+1,a+n+1,[](int x,int y){return x>y;});
    For(i,1,n)s[i]=s[i-1]+a[i];
    fill(g+1,g+n+1,INF);
    For(i,l,r)
        Rof(j,n,i)
            chkmin(g[j],g[j-i]+1);
    // printf("g:");
    // For(i,1,n)printf("%d ",g[i]);
    // wln;
    For(i,0,n-1)
        For(j,1,n)
            fill(f[i][j]+1,f[i][j]+n+1,INF);
    f[0][1][1]=0;
    For(i,0,n-1)
        For(j,1,n)
            For(k,1,j)
                if(f[i][j][k]<INF)
                    For(ii,1,n)
                        if(g[ii]<=k&&j-g[ii]+ii<=n)
                        {
                            // printf("i=%d,j=%d,k=%d,ii=%d,g=%d,x=%d,y=%d\n",i,j,k,ii,g[ii],s[j]-s[j-g[ii]],s[ii]-s[j-g[ii]]);
                            chkmin(f[i+1][j-g[ii]+ii][ii],f[i][j][k]-i*(s[j]-s[j-g[ii]])+(i+1)*(s[j-g[ii]+ii]-s[j-g[ii]]));
                        }
    // For(i,0,n-1)
    //     For(j,1,n)
    //         For(k,1,j)
    //             if(f[i][j][k]<INF)printf("f[%d][%d][%d]=%d\n",i,j,k,f[i][j][k]);
    int ans=INF;
    For(i,0,n-1)
        For(k,1,n)
            chkmin(ans,f[i][n][k]);
    if(ans<INF)printf("%d\n",ans);
    else printf("0\n");
}