#include <bits/stdc++.h>
using namespace std;
int a[1005], f[1005];        // 全局数组：f 自动初始化为 0
int main() {
    int n, s, t;
    cin >> n >> s >> t;
    for (int i = 1; i <= n; i++) cin >> a[i];
    f[1] = a[1];
    for (int i = 2; i <= n; i++)
        for (int j = s; j <= t; j++)
            if (i - j >= 1)
                f[i] = max(f[i], f[i - j] + a[i]);
    cout << f[n] << endl;
    return 0;
}