#include <bits/stdc++.h>
using namespace std;
const int INF = 1000 * 1000 * 1000;
int ans;
int v[400 + 1];
int dp[50 + 1][400 + 1][2];
inline void upd(int a[], int b[], int smin, int smax) {
  ans = max(ans, max(b[0] - smin, b[1] + smax));
  a[0] = max(a[0], max(b[0], b[1] + 2 * smax));
  a[1] = max(a[1], max(b[0] - 2 * smin, b[1]));
}
int main() {
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> v[i];
  int sum = 0;
  for (int i = 1; i <= n; i++) {
    sum += v[i];
    dp[1][i][0] = sum;
    dp[1][i][1] = -sum;
  }
  for (int i = 2; i <= n; i++) {
    sum = 0;
    for (int j = i; j <= n; j++) {
      sum += v[j];
      dp[1][j][0] = max(dp[1][j][0], sum);
      dp[1][j][1] = max(dp[1][j][1], -sum);
    }
  }
  for (int i = 2; i <= k; i++) {
    ans = 0;
    for (int j = i; j <= n; j++) {
      int smin = v[j], smax = v[j];
      sum = v[j];
      dp[i][j][0] = dp[i][j][1] = -INF;
      upd(dp[i][j], dp[i - 1][j - 1], smin, smax);
      for (int p = j - 1; p >= i; p--) {
        sum += v[p];
        smin = min(smin, sum);
        smax = max(smax, sum);
        upd(dp[i][j], dp[i - 1][p - 1], smin, smax);
      }
    }
  }
  cout << ans;
  return 0;
}
