#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> p32;
typedef pair<ll, ll> p64;
typedef pair<double, double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int>> vv32;
typedef vector<vector<ll>> vv64;
typedef vector<vector<p64>> vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i, e) for (ll i = 0; i < e; i++)
#define forsn(i, s, e) for (ll i = s; i < e; i++)
#define rforn(i, s) for (ll i = s; i >= 0; i--)
#define rforsn(i, s, e) for (ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())

int main()
{
    //ifstream cin("be.txt");

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int n;
    cin >> n;

    int q;
    cin >> q;

    string s;
    cin >> s;

    int i = 0;
    vector<int> c(2);
    while (i < n)
    {
        if (s[i] != s[i - 1] || i == 0)
        {
            c[s[i] - '0']++;
        }
        i++;
    }
    cout << min(c[0], c[1]) << ln;

    while (q--)
    {
        int change;
        cin >> change;
        change--;
        s[change] = abs(s[change] - '1') + '0';

        if (change == 0)
        {
            if (s[change] != s[change + 1])
                c[s[change] - '0']++;
            else
                c[abs(s[change] - '1')]--;
        }
        else if (change == n - 1)
        {
            if (s[change] != s[change - 1])
                c[s[change] - '0']++;
            else
                c[abs(s[change] - '1')]--;
        }
        else if (s[change] != s[change - 1] && s[change] != s[change + 1])
        {
            c[0]++;
            c[1]++;
        }
        else if (s[change] == s[change - 1] && s[change] == s[change + 1])
        {
            c[0]--;
            c[1]--;
        }

        cout << min(c[0], c[1]) << ln;
    }


    return 0;
}