#include <bits/stdc++.h>
using namespace std;
const int N = 201;
long long arr[N], a, b, k, n, dp[N][N][N], x;
long long OO = (long long)1000000000000000;
long long solve(int i, int prv, int rem) {
  if (rem < 0) {
    return -OO;
  }
  if (i > n || rem == 0) {
    if (i > n) {
      if (i - prv - 1 >= k) {
        return -OO;
      }
      return 0;
    } else {
      if (i - prv >= k || n - prv >= k) {
        return -OO;
      }
      return 0;
    }
  }
  long long &ret = dp[i][prv][rem];
  if (ret != -1) {
    return ret;
  }
  ret = solve(i + 1, i, rem - 1) + arr[i];
  if (i - prv < k) ret = max(ret, solve(i + 1, prv, rem));
  return ret;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  memset(dp, -1, sizeof(dp));
  cin >> n >> k >> x;
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
  }
  long long ret = solve(1, 0, x);
  if (ret < 0) {
    cout << -1 << endl;
    return 0;
  }
  cout << ret << endl;
}
