#include <bits/stdc++.h>
using namespace std;

int n, q;
string s;
vector<int> v;
vector<int> cnt;

void solve() {
    cin >> n >> q >> s;
    v.assign(1 + n + 1, 0);
    for(int i = 1; i <= n; i++) {
        v[i] = s[i - 1] - '0';
    }
    v[0] = -1;
    v[n + 1] = -1;
    cnt.assign(2, 0);
    for(int i = 1; i <= n; i++) {
        if(v[i] != v[i - 1]) {
            cnt[v[i]]++;
        }
    }
    cout << min(cnt[0], cnt[1]) << "\n";
    while(q--) {
        int i;
        cin >> i;
        if(n == 1) {
            cout << "0\n";
            continue;
        }
        if(i == 1 || i == n) {
            int j = 0;
            if(i == 1) {
                j = 2;
            }
            if(i == n) {
                j = n - 1;
            }
            if(v[i] != v[j]) {
                cnt[v[i]]--;
            } else {
                cnt[1 - v[i]]++;
            }
            v[i] = 1 - v[i];
        } else {
            v[i] = 1 - v[i];
            if(v[i - 1] == v[i] && v[i + 1] == v[i]) {
                cnt[0]--;
                cnt[1]--;
            }
            if(v[i - 1] != v[i] && v[i + 1] == v[i]) {
                //
            }
            if(v[i - 1] == v[i] && v[i + 1] != v[i]) {
                //
            }
            if(v[i - 1] != v[i] && v[i + 1] != v[i]) {
                cnt[0]++;
                cnt[1]++;
            }
        }
        cout << min(cnt[0], cnt[1]) << "\n";
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}