#include <bits/stdc++.h> #define FOR(i, l, r) for (int i = l; i <= r; i++) #define FOD(i, r, l) for (int i = r; i >= l; i--) #define fo(i, l, r) for (int i = l; i < r; i++) #define fi first #define se second #define pb push_back #define fillchar(f, x) memset(f, x, sizeof f); using namespace std; typedef pair<int, int> ii; typedef unsigned long long ull; typedef long long ll; typedef vector<int> vi; const int N = 1e5 + 1; int n, l, r; ll pre[N]; signed main(void) { ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); // freopen(".inp","r",stdin); // freopen(".out","w",stdout); cin >> n >> l >> r; FOR(i, 1, n) { int x; cin >> x; pre[i] = pre[i - 1] + x; } deque<long long> q; long long ans = -1e13; FOR(i, l, n) { while (q.size() && q.front() < i - r) q.pop_front(); while (q.size() && pre[q.back()] >= pre[i - l]) q.pop_back(); q.push_back(i - l); ans = max(ans, pre[i] - pre[q.front()]); } cout << ans; }