#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) REP(i, 0, a)
#define EACH(i, a) for (auto i: a)
#define ITR(x, a) for (__typeof(a.begin()) x = a.begin(); x != a.end(); x++)
#define ALL(a) (a.begin()), (a.end())
#define HAS(a, x) (a.find(x) != a.end())
#define endl '\n'

int n, m;
int w[3005];
bool removed[3005];

int main(void) {
  cin >> n >> m;
  rep(i, n) cin >> w[i];
  int ans = 0, rem = n;
  rep(i, n) ans += w[i];

  while (rem-- > m) {
    int pos = -1, decrease = 1e8;
    rep(i, n) {
      if (removed[i]) continue;
      int l = (i - 1 + n) % n, r = (i + 1) % n;
      int tmp = 0;
      if (!removed[l]) tmp += w[l];
      if (!removed[r]) tmp += w[i];
      if (tmp < decrease) {
        pos = i;
        decrease = tmp;
      }
    }
    removed[pos] = true;
    ans -= decrease;
  }
  cout << ans << endl;

  return 0;
}