#include<cstdio>

 #include<algorithm>

 #include<iostream>

 #include<cmath>

 #include<cstring>

 #include<cctype>

 using namespace std;

 typedef long long ll;

 #define enter printf("\n")

 const int maxn = 1e5 + ;

 const int INF = 0x3f3f3f3f;

 inline ll read()

 {

     ll ans = ;

     char ch = getchar(), last = ' ';

     while(!isdigit(ch)) {last = ch; ch = getchar();}

     while(isdigit(ch))

     {

         ans = ans *  + ch - ''; ch = getchar();

     }

     if(last == '-') ans = -ans;

     return ans;

 }

 inline void write(ll x)

 {

     if(x < ) {putchar('-'); x = -x;}

     if(x == ) {putchar(''); return;}

     int q[], N = ;

     q[] = ;

     while(x) {q[++N] = x % ; x /= ;}

     while(N) {putchar('' + q[N]); --N;}

 }                  //忽略掉优化 

 int n, l, r;

 ll a[maxn], sum[maxn];

 ll ans = (ll)-INF * INF;

 ll dp[maxn][];

 int size[maxn];

 void RMQ(int n)

 {

     for(int i = ; i <= n; ++i)

     dp[i][] = sum[i];

     for(int j = ; ( << j) <= n; ++j)

         for(int i = ; i + ( << j) -  <= n; ++i)

             dp[i][j] = max(dp[i][j - ], dp[i + ( << (j - ))][j - ]);

     int k = ;

     for(int i = ; i <= n; ++i)

     {

         if (( << k) <= i) k++;

         size[i] = k - ;//求长度j

     }

 }

 ll query(int L, int R)

 {

     int k = size[R - L + ];

     return max(dp[L][k], dp[R - ( << k) + ][k]);

 }

 int main()

 {

     freopen("holiday.in", "r", stdin);

     freopen("holiday.out", "w", stdout);

     n = read(); l = read(); r = read();

     for(int i = ; i <= n; ++i)

     {

         a[i] = read();

         sum[i] = sum[i - ] + a[i];

     }   //求前缀和

     RMQ(n);

     for(int i = ; i <= n - l; ++i)

     {

         int L = i + l, R = i + r;

         if(R > n) R = n;

         ll _ans = query(L, R) - sum[i];

         ans = max(ans, _ans);

     }

     write(ans); enter;

     return ;

 }