#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

inline int read() {
    int f = 1, k = 0;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        k = k * 10 + c - '0';
        c = getchar();
    }
    return f * k;
}

int main() {
    int n = read(), k = read();
    vector<int> a(n + 2);
    vector<bool> st(n + 1);
    for (int i = 1; i <= n; ++i) a[i] = read();
    a[0] = a[n], a[n + 1] = a[1];
    for (int i = 1; i <= n; ++i) {
        if (k && a[i - 1] + a[i] + a[i + 1] == 3) {
            --k;
            st[i] = 1;
        }
    }
    for (int i = 1; i <= n; ++i) {
        if (!st[i] && k && a[i - 1] + a[i] + a[i + 1] == 2) {
            --k;
            st[i] = 1;
        }
    }
    for (int i = 1; i <= n; ++i) {
        if (!st[i] && k && a[i - 1] + a[i] + a[i + 1] == 1) {
            --k;
            st[i] = 1;
        }
    }
    for (int i = 1; i <= n; ++i) {
        if (k) {
            --k;
            st[i] = 1;
        }
    }
    ll ans = 0;
    st[0] = st[n], st[n + 1] = st[1];
    for (int i = 1; i <= n; ++i) {
        if (a[i]) ans += 3;
        else ans += !st[i - 1] + !st[i] + !st[i + 1];
    }
    cout << ans;
}