#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 /= 2;
    cout << val << "\n";
    b.push_back(b.size()-2);
    b[0] = b[2];
    while (q--){
        int a;
        cin >> a;
        b[a] = 1 - b[a];
        if (b[a-1] == b[a+1]) val += b[a-1] == b[a] ? -1 : +1;
        cout << val << "\n";
    }
}