#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll NEG_INF = -(ll)4e18;
 
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
 
    int n, k, x;
    cin >> n >> k >> x;
    vector<ll> a(n+1);
    for(int i = 1; i <= n; i++) 
        cin >> a[i];
 
    // dp[i][j] = max sum using exactly j picks, with the j-th pick at position i
    static ll dp[201][201];
    for(int i = 0; i <= n; i++)
      for(int j = 0; j <= x; j++)
        dp[i][j] = NEG_INF;
 
    dp[0][0] = 0;  // “0 picks, ending at position 0” = 0 sum
 
    // Build up
    for(int i = 1; i <= n; i++){
      for(int j = 1; j <= x; j++){
        ll bestPrev = NEG_INF;
        // Try picking a[i] as the j-th repost, previous pick was at t = i - d
        for(int d = 1; d <= k && i - d >= 0; d++){
          bestPrev = max(bestPrev, dp[i - d][j - 1]);
        }
        if(bestPrev > NEG_INF)
          dp[i][j] = bestPrev + a[i];
      }
    }
 
    // Now your last pick must be within the last k positions: i in [n-k+1 .. n]
    ll ans = NEG_INF;
    for(int i = n - k + 1; i <= n; i++){
      ans = max(ans, dp[i][x]);
    }
    if(ans < 0) ans = -1;
    cout << ans << "\n";
    return 0;
}
 

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnVzaW5nIGxsID0gbG9uZyBsb25nOwpjb25zdCBsbCBORUdfSU5GID0gLShsbCk0ZTE4OwoKaW50IG1haW4oKXsKICAgIGlvczo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsKICAgIGNpbi50aWUobnVsbHB0cik7CgogICAgaW50IG4sIGssIHg7CiAgICBjaW4gPj4gbiA+PiBrID4+IHg7CiAgICB2ZWN0b3I8bGw+IGEobisxKTsKICAgIGZvcihpbnQgaSA9IDE7IGkgPD0gbjsgaSsrKSAKICAgICAgICBjaW4gPj4gYVtpXTsKCiAgICAvLyBkcFtpXVtqXSA9IG1heCBzdW0gdXNpbmcgZXhhY3RseSBqIHBpY2tzLCB3aXRoIHRoZSBqLXRoIHBpY2sgYXQgcG9zaXRpb24gaQogICAgc3RhdGljIGxsIGRwWzIwMV1bMjAxXTsKICAgIGZvcihpbnQgaSA9IDA7IGkgPD0gbjsgaSsrKQogICAgICBmb3IoaW50IGogPSAwOyBqIDw9IHg7IGorKykKICAgICAgICBkcFtpXVtqXSA9IE5FR19JTkY7CgogICAgZHBbMF1bMF0gPSAwOyAgLy8g4oCcMCBwaWNrcywgZW5kaW5nIGF0IHBvc2l0aW9uIDDigJ0gPSAwIHN1bQoKICAgIC8vIEJ1aWxkIHVwCiAgICBmb3IoaW50IGkgPSAxOyBpIDw9IG47IGkrKyl7CiAgICAgIGZvcihpbnQgaiA9IDE7IGogPD0geDsgaisrKXsKICAgICAgICBsbCBiZXN0UHJldiA9IE5FR19JTkY7CiAgICAgICAgLy8gVHJ5IHBpY2tpbmcgYVtpXSBhcyB0aGUgai10aCByZXBvc3QsIHByZXZpb3VzIHBpY2sgd2FzIGF0IHQgPSBpIC0gZAogICAgICAgIGZvcihpbnQgZCA9IDE7IGQgPD0gayAmJiBpIC0gZCA+PSAwOyBkKyspewogICAgICAgICAgYmVzdFByZXYgPSBtYXgoYmVzdFByZXYsIGRwW2kgLSBkXVtqIC0gMV0pOwogICAgICAgIH0KICAgICAgICBpZihiZXN0UHJldiA+IE5FR19JTkYpCiAgICAgICAgICBkcFtpXVtqXSA9IGJlc3RQcmV2ICsgYVtpXTsKICAgICAgfQogICAgfQoKICAgIC8vIE5vdyB5b3VyIGxhc3QgcGljayBtdXN0IGJlIHdpdGhpbiB0aGUgbGFzdCBrIHBvc2l0aW9uczogaSBpbiBbbi1rKzEgLi4gbl0KICAgIGxsIGFucyA9IE5FR19JTkY7CiAgICBmb3IoaW50IGkgPSBuIC0gayArIDE7IGkgPD0gbjsgaSsrKXsKICAgICAgYW5zID0gbWF4KGFucywgZHBbaV1beF0pOwogICAgfQogICAgaWYoYW5zIDwgMCkgYW5zID0gLTE7CiAgICBjb3V0IDw8IGFucyA8PCAiXG4iOwogICAgcmV0dXJuIDA7Cn0K

NSAyIDMKNSAxIDMgMTAgMQo=

5 2 3
5 1 3 10 1