Example

Input

6 3
1 0 0 1 0 1
1 3 2


Output

1
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

signed main() {
    int N, M; cin >> N >> M;
    vector<int> b(N), p(M);
    rep(i,0,N) cin >> b[i];
    rep(i,0,M) cin >> p[i];

    int ans = INF;
    rep(k,0,2) {
        int col = k, cnt = 0, idx = 0;
        vector<int> v;
        rep(i,0,N) {
            v.push_back(col);
            if(++cnt == p[idx]) cnt = 0, idx++, col ^= 1;
        }

        vector<int> c = b;
        int cost = 0;
        rep(i,0,N) {
            if(c[i] != v[i]) {
                rep(j,i+1,N) {
                    if(c[j] == v[i]) {
                        cost += j - i;
                        swap(c[i], c[j]);
                        break;
                    }
                }
                if(c[i] != v[i]) cost = INF;
            }
        }
        chmin(ans, cost);
    }
    cout << ans << endl;
    return 0;
}