#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

int N,M;
int memo[3010][3010][2][2];//n, m, bef, pick0
int nums[3010];
#define INIT 1070000001
int dp_go(int n, int m, bool bef, bool pick0 = false) {
  if (n == N) {
    if (m == M) {
      if (pick0 && bef) {
        return nums[n-1];
      }else{
        return 0;
      }
    }
    return -INF;
  }
  if (memo[n][m][bef][pick0] != INIT) {
    return memo[n][m][bef][pick0];
  }
  int ret = dp_go(n+1,m,false,pick0);
  if (m < M) {
    if (n == 0) {
      ret = max(ret, dp_go(n+1,m+1,true,true));
    }else{
      if (bef) {
        ret = max(ret, dp_go(n+1,m+1,true,pick0) + nums[n-1]);
      }else{
        ret = max(ret, dp_go(n+1,m+1,true,pick0));
      }
    }
  }
  return memo[n][m][bef][pick0] = ret;
}


int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  rep(i,3005){
    rep(j,3005){
      rep(k,2){
        memo[i][j][k][0] = INIT;
        memo[i][j][k][1] = INIT;
      }
    }
  }
  cin >> N >> M;
  rep(i,N) {
    cin >> nums[i];
  }
  cout << dp_go(0,0,false) << endl;
  return 0;
}