#include <bits/stdc++.h>
#define dd(x) cout << #x << "\n"
#define d(x) cout << #x  << ": " << x << "\n"
using namespace std;
#define int long long
using pii = pair<int, int>;
using vpii = vector<pii>;
using vi = vector<int>;
using vii = vector<vector<int>>;
using a3 = array<int, 3>;
const int inf = 0x3f3f3f3f3f3f3f3fLL;

int n;
int positive(int x) {
    return ((x % n) + n) % n;
}

void solve() {
    int m; cin >> n >> m;
    vector<int> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }

    priority_queue<int> Q;
    vector<int> con(n);

    int ans = 3 * n;
    for(int i = 0; i < n; i++) {
        con[i] = (a[positive(i - 1)]) + (a[i]) + (a[positive(i + 1)]);
        Q.push(con[i]);
    }

    while(m--) {
        int x = Q.top(); Q.pop();
        if(x == 2) ans--;
        if(x == 1) ans -= 2;
        if(!x) ans -= 3;
    }
    cout << ans << "\n";
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int T = 1;
    while(T--) solve();
    return 0;
}

/*
5 2
1 0 1 0 1
*/