#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
const LL N = 2e5 + 10, INF = 0x3f3f3f3f, mod = 1e9 + 7;
LL p[N];

void solve()
{
    LL n, a;
    cin >> n >> a;
    
    for (LL i = 0; i < n; i++)
        cin >> p[i];
    
    LL ans = 0, cnt0 = a;
    LL cnt[4] = {0, 0, 0, 0};

    ans = n * 3;
    for (LL i = 0; i < n; i++)
    {
        LL l = (i - 1 + n) % n, r = (i + 1) % n;
        LL x = p[l] + p[i] + p[r];
        x = 3 - x;
        cnt[x]++;
    }

    for (LL i = 0; i < 4; i++)
    {
        if (!cnt0)  break;
        ans -= min(cnt0, cnt[i]) * i;
        cnt0 -= min(cnt0, cnt[i]);
    }

    cout << ans;
    cout << endl;
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    LL T = 1;
    while (T--)
        solve();
    return 0;
}