#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() {
    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 = 405;
int n, m, f[N][N][55], a[N], sum[N];
inline int max(int x, int y) { return x > y ? x : y; }
signed main() {
  io.read(n), io.read(m);
  for (register int i = (1); i <= (n); i++)
    io.read(a[i]), sum[i] = sum[i - 1] + a[i];
  for (register int i = (1); i <= (n); i++)
    for (register int j = (2); j <= (min(i, m)); j++)
      for (register int k = (j - 1); k <= (i - 1); k++)
        for (register int p = (j - 2); p <= (k - 1); p++)
          f[i][k][j] = max(f[i][k][j],
                           f[k][p][j - 1] + abs(sum[i] - 2 * sum[k] + sum[p]));
  int ans = 0;
  for (register int i = (1); i <= (n); i++)
    for (register int j = (1); j <= (i); j++) ans = max(ans, f[i][j][m]);
  io.write(ans);
  return 0;
}
