#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll N,K;cin>>N>>K;
  vl A(N);cin>>A;
  A.insert(A.begin(),0);
  A.emplace_back(0);
  ll ans=0;
  rep(i,0,N+1)ans+=abs(A[i]-A[i+1]);
  vl L(N+2),R(N+2);
  rep(i,0,N+2)L[i]=R[i]=i;
  dsu D(N+2);
  rep(i,0,N+1)if(A[i]==A[i+1]){
  	ll u=D.leader(i),v=D.leader(i+1);
  	ll w=D.merge(u,v);
  	L[w]=min(L[u],L[v]);
  	R[w]=max(R[u],R[v]);
  }
  min_priority_queue<pl>Q;
  rep(i,0,N+1)if(D.leader(i)==i){
  	ll l=L[i],r=R[i];
  	if(l!=0&&r!=N+1&&A[l]>A[l-1]&&A[r]>A[r+1])Q.emplace(r-l+1,i);
  }
  while(K){
  	if(D.size(0)==N+2)break;
  	auto[l,v]=Q.top();Q.pop();
  	assert(v==D.leader(v));
  	assert(L[v]);
  	assert(R[v]<N+1);
  	ll adj=max(A[D.leader(L[v]-1)],A[D.leader(R[v]+1)]);
  	if(K<=(A[v]-adj)*l){
  	  ans-=K/l*2;
  	  break;
  	}
  	ans-=2*(A[v]-adj);
  	K-=(A[v]-adj)*l;
  	A[v]=adj;
  	if(adj==A[D.leader(L[v]-1)]){
  	  ll u=D.leader(L[v]-1);
  	  ll w=D.merge(u,v);
  	  A[w]=adj;
  	  L[w]=min(L[v],L[u]);
  	  R[w]=max(R[v],R[u]);
  	  v=w;
  	}
  	if(adj==A[D.leader(R[v]+1)]){
  	  ll u=D.leader(R[v]+1);
  	  ll w=D.merge(u,v);
  	  A[w]=adj;
  	  L[w]=min(L[v],L[u]);
  	  R[w]=max(R[v],R[u]);
  	  v=w;
  	}
  	if(L[v]==0)break;
  	if(A[D.leader(L[v]-1)]<A[v]&&A[v]>A[D.leader(R[v]+1)])Q.emplace(R[v]-L[v]+1,v);
  }
  cout<<ans<<endl;
  return 0;
}