#include <bits/stdc++.h>
using namespace std;
struct IO {
  char buf[(1 << 20)], *p1, *p2;
  char pbuf[(1 << 20)], *pp;
  IO() : p1(buf), p2(buf), pp(pbuf) {}
  inline char gc() {
    return getchar();
    if (p1 == p2) p2 = (p1 = buf) + fread(buf, 1, (1 << 20), stdin);
    return p1 == p2 ? ' ' : *p1++;
  }
  inline bool blank(char ch) {
    return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
  }
  template <class T>
  inline void read(T &x) {
    register double tmp = 1;
    register bool sign = 0;
    x = 0;
    register char ch = gc();
    for (; !(ch >= '0' && ch <= '9'); ch = gc())
      if (ch == '-') sign = 1;
    for (; (ch >= '0' && ch <= '9'); ch = gc()) x = x * 10 + (ch - '0');
    if (ch == '.')
      for (ch = gc(); (ch >= '0' && ch <= '9'); ch = gc())
        tmp /= 10.0, x += tmp * (ch - '0');
    if (sign) x = -x;
  }
  inline void read(char *s) {
    register char ch = gc();
    for (; blank(ch); ch = gc())
      ;
    for (; !blank(ch); ch = gc()) *s++ = ch;
    *s = 0;
  }
  inline void read(char &c) {
    for (c = gc(); blank(c); c = gc())
      ;
  }
  template <class t>
  inline void write(t x) {
    if (x < 0)
      putchar('-'), write(-x);
    else {
      if (x > 9) write(x / 10);
      putchar('0' + x % 10);
    }
  }
} io;
const int mod = 1e9 + 7;
const int mo = 998244353;
const int N = 3e4 + 5;
const int M = 505;
int n, m, a[N], f[N][M][4], b[N], ans;
int main() {
  io.read(n), io.read(m);
  for (int i = (1); i <= (n); i++) io.read(a[i]);
  memset(f, -63, sizeof(f));
  for (int i = (0); i <= (n); i++)
    for (int j = (0); j <= (3); j++) f[i][0][j] = 0;
  for (int i = (1); i <= (n); i++)
    for (int j = (1); j <= (min(i, m)); j++) {
      int gs = 1 + (j != 1 && j != m);
      f[i][j][1] = max(f[i - 1][j][1], f[i - 1][j - 1][2]) - a[i] * gs;
      f[i][j][3] = max(f[i - 1][j][3], f[i - 1][j - 1][0]) + a[i] * gs;
      f[i][j][0] = max(f[i - 1][j][0], f[i][j][1]);
      f[i][j][2] = max(f[i - 1][j][2], f[i][j][3]);
      if (gs == 2) {
        f[i][j][0] = max(f[i][j][0], f[i - 1][j - 1][0]);
        f[i][j][2] = max(f[i][j][2], f[i - 1][j - 1][2]);
      }
    }
  io.write(max(f[n][m][0], f[n][m][2]));
  return 0;
}
