#include <bits/stdc++.h>

using namespace std;

int main()
{
    //ios::sync_with_stdio(false);
    //cin.tie(nullptr);

    int n, m;
    cin >> n >> m;
    vector<int> arr(n, 0), vals(2, 0);
    int oneGroup = 0, zeroGroup = 0;
    int prev = -1;
    for (int i = 0; i < n; i++) {
        char x;
        cin >> x;
        arr[i] = (int)x - '0';
        if (arr[i] != prev) {
            if (arr[i] == 0) vals[0]++;
            else vals[1]++;
        }
        prev = arr[i];
    }
    cout << min(vals[0], vals[1]) << '\n';

    if (n == 1) {
        for (int i=0; i < m; i++) {
            cout << 0 << '\n';
        }
    }

    for (int k=0; k < m; k++) {
        int i;
        cin >> i;
        i--;

        if (i == 0) {
            if (arr[i] != arr[i + 1]) {// what if arr[i] == arr[i - 1]
                vals[arr[i]]--;
            } else {
                vals[(arr[i] + 1) % 2]++;
            }
            arr[i] = (arr[i] + 1) % 2;
            cout << min(vals[0], vals[1]) << '\n';
            continue;
        }
        if (i == n - 1) {
            if (arr[i] != arr[i - 1]) {// what if arr[i] == arr[i - 1]
                vals[arr[i]]--;
            } else {
                vals[(arr[i] + 1) % 2]++;
            }
            arr[i] = (arr[i] + 1) % 2;
            cout << min(vals[0], vals[1]) << '\n';
            continue;
        }
        if (arr[i] != arr[i + 1] && arr[i] != arr[i - 1]) {
            vals[0]--;
            vals[1]--;
        }
        if (arr[i] == arr[i + 1] && arr[i] == arr[i - 1]) {
            vals[0]++;
            vals[1]++;
        }
        arr[i] = (arr[i] + 1) % 2;
        cout << min(vals[0], vals[1]) << '\n';
    }

    return 0;
}