#include <bits/stdc++.h>

#define sz(v) v.size()
#define forn(i,n) for(int i = 0; i < n; ++i)
#define fi first
#define se second
#define el '\n'
#define all(v) v.begin(),v.end()
#define pb push_back
#define d(x) cout << #x << " : " << x << el

using namespace std;

typedef pair<int,int> ii;

int dr[] = {1,0,-1,0};
int dc[] = {0,1,0,-1};

const int nax = 1e5 + 20;
vector<int> g[nax];


int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  cout << setprecision(20)<< fixed;

  int n, cnt;
  cin >> n >> cnt;
  cnt = n - cnt;
  vector<int> a(n);
  vector<bool> pos(n);
  int ans = 0;
  forn(i,n){
    cin >> a[i];
    if(a[i]==1) ans += 3;
  }
  forn(i,n){
    if(!a[(i+1)%n] && !a[i] && !a[(i-1+n)%n] && cnt){
      pos[i] = 1;
      --cnt;
    }
  }
  forn(i,n){
    if(!a[(i+1)%n] && a[i] && !a[(i-1+n)%n] && cnt){
      pos[i] = 1;
      --cnt;
    }
  }
  
  forn(i,n){
    if(!pos[i] && !a[i] && !a[(i+1)%n] && cnt){
      pos[i] = 1;
      --cnt;
    }
    if(!pos[i] && !a[i] && !a[(i-1+n)%n] && cnt){
      pos[i] = 1;
      --cnt;
    }
  }
  forn(i,n){
    if(!pos[i] && !a[i] && cnt){
      pos[i] = 1;
      --cnt;
    }
  }
  forn(i,n){
    if(!a[i]){
      ans += (pos[i] + pos[(i+1)%n] + pos[(i-1+n)%n]);
    }
  }
  cout << ans << el;
}