#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 1e5 + 10, M = 110;
int n, m;
int w[N];
int f[N][M][2]; //f[i][j][0]代表从前i天中选,共进行了j次交易,当前状态为不持有股票的最大收益
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i ++ ) scanf("%d", &w[i]);
memset(f, -0x3f, sizeof f); //要求最大值,先初始化为负无穷
for (int i = 0; i <= n; i++) f[i][0][0] = 0; //不管几天,只要没有交易收益就是0
for (int i = 1; i <= n; i++) { //状态机见上图
for (int j = 1; j <= m; j++) {
f[i][j][0] = max(f[i - 1][j][0], f[i - 1][j][1] + w[i]);
f[i][j][1] = max(f[i - 1][j][1], f[i - 1][j - 1][0] - w[i]);
}
}
int res = 0;
//最后一天,共交易k次,且最后不持有股票的最大值即为结果
for (int k = 0; k <= m; k ++ ) res = max(res, f[n][k][0]);
printf("%d\n", res);
return 0;
}