from collections import defaultdict

class UnionFind():
    def __init__(self, n, A):
        self.n = n
        self.parents = [-1] * n
        self.v = A[:]
        self.left = [i for i in range(n)]
        self.right = [i for i in range(n)]

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def get(self, x):
        return self.v[self.find(x)]

    def dec(self, x, y):
        self.v[self.find(x)] -= y

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

        self.right[x] = self.right[x] if self.right[x] > self.right[y] else self.right[y]
        self.left[x] = self.left[x] if self.left[x] < self.left[y] else self.left[y]


    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

import heapq
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))

uf = UnionFind(N,A)
for i in range(N-1):
    if(A[i] == A[i+1]):
        uf.union(i,i+1)

q = []
done = set()
for i in range(N):
    lv = uf.get(uf.left[uf.find(i)] - 1) if uf.left[uf.find(i)] > 0 else 0
    rv = uf.get(uf.right[uf.find(i)] + 1) if uf.right[uf.find(i)] < N-1 else 0
    if(lv < uf.get(i) > rv and uf.find(i) not in done):
        done.add(uf.find(i))
        heapq.heappush(q, (uf.size(i), uf.get(i), i))

while(K):
    if(not q):break
    size,v,idx = heapq.heappop(q)

    if(uf.get(idx) != v):continue
    if(size != uf.size(idx)):continue
    if(size > K):break
    if(v == 0):break

    lv = uf.get(uf.left[uf.find(idx)] - 1) if uf.left[uf.find(idx)] > 0 else 0
    rv = uf.get(uf.right[uf.find(idx)] + 1) if uf.right[uf.find(idx)] < N-1 else 0
    can = min(v - max(lv,rv), K//size)
    uf.dec(idx, can)
    K -= uf.size(idx) * can

    l = uf.left[uf.find(idx)]
    if(l > 0 and uf.get(l-1) == uf.get(l)):uf.union(l-1,l)
    r = uf.right[uf.find(idx)]
    if(r < N-1 and uf.get(r) == uf.get(r+1)):uf.union(r,r+1)

    lv = uf.get(uf.left[uf.find(idx)] - 1) if uf.left[uf.find(idx)] > 0 else 0
    rv = uf.get(uf.right[uf.find(idx)] + 1) if uf.right[uf.find(idx)] < N-1 else 0
    if(lv < uf.get(idx) > rv):heapq.heappush(q, (uf.size(idx), uf.get(idx), idx))

A = [uf.get(i) for i in range(N)]
ans = A[0] + A[-1]
for i in range(N-1):
    ans += abs(A[i] - A[i+1])
print(ans)