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

int main()
{
    int n, q, val=0;
    cin >> n >> q;
    vector<int> b(n+1);
    b[0] = -1;
    for (int i=1; i<=n; i++){
        char c;
        cin >> c;
        b[i] = c - '0';
        if (b[i] != b[i-1]) val++;
    }
    val;
    cout << val/2 << "\n";
    b.push_back(-1);
    while (q--){
        int a;
        cin >> a;
        b[a] = 1 - b[a];
        if (n == 1){
            val = 0;
        }
        else if (a == 1 || a == n){
            val += (b[a-1] == b[a] || b[a+1] == b[a]) ? -1 : +1;
        }
        else if (b[a-1] == b[a+1]) val += (b[a-1] == b[a]) ? -2 : +2;
        cout << val/2 << "\n";
    }
}