Example

Input

6 3
1 0 0 1 0 1
1 3 2


Output

1
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1e9+7;
constexpr lint INF = mod * mod;
constexpr int MAX = 300010;

int n, m, b[15], p[15], a[15];

int f(){
    int v[n], ret = 0;
    vector<int> s, t;
    rep(i, n)if(b[i] == 1) s.push_back(i);
    rep(i, n)if(a[i] == 1) t.push_back(i);
    if(s.size() != t.size()) return 1000;
    rep(i, s.size()) ret += abs(s[i] - t[i]);
    return ret;
}

int main(){
    scanf("%d%d", &n, &m);
    rep(i, n) scanf("%d", &b[i]);
    rep(i, m) scanf("%d", &p[i]);
    int ans = 1000;
    rep(i, 2){
        for(int cur=0, j=0; j<m; ++j){
            rep(k, p[j]) a[cur++] = (j%2) ^ i;
        }
        chmin(ans, f());
    }
    printf("%d\n", ans);
}
