n,m = map(int, input().split())
lt = list(map(int, input().split()))
lt = [0] +lt
inf = -1e12
f = [[[inf,inf] for _ in range(m+1)]for _ in range(n+1)]
for i in range(n+1):
f[i][0][0] = 0
for i in range(1,n+1):
for j in range(1,m+1):
f[i][j][0] = max(f[i-1][j][0], f[i-1][j][1] + lt[i]) # 卖出
f[i][j][1] = max(f[i-1][j][1], f[i-1][j-1][0] - lt[i]) # 买入
res = 0
for i in range(1,m+1):
res = max(f[n][i][0],res)
print(res)