#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
// #pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

std::lcm(ll a, ll b), std::gcd(int a, int b)

cout << fixed << setprecision(n);

set with custom ordering
set<ll, decltype(&cmp)> qu(cmp);

*/

typedef int64_t ll;

void solve() {

	ll n, q;
	cin >> n >> q;
	vector<bool> v(n+1, 0);
	vector<ll> s(2, 0);

	// 0 -> piros
	// 1 -> kek

	for(ll i = 1; i <= n; i++) {
		char c;
		cin >> c;
		if(c == '1') {
			v[i] = true;
		}

		if(i > 1 && v[i] != v[i-1]) {
			s[v[i-1]]++;
		}
	}

	s[v[n]]++;

	//cerr << "\ns=" << s;
	cout << min(s[0], s[1]) << "\n";
	
	for(ll qi = 0; qi < q; qi++) {
		ll ind;
		cin >> ind;

		if(ind == 1) {

			// egy bal szomszed
			if(v[1] == v[2]) {
				v[1] = 1 - v[1];
				s[v[1]]++;
			}else{
				s[v[1]]--;
				v[1] = 1 - v[1];
			}

		}else if(ind == n) {
			
			if(v[n] == v[n-1]) {
				v[n] = 1 - v[n];
				s[v[n]]++;
			}else{
				s[v[n]]--;
				v[n] = 1 - v[n];
			}

		}else{

			if(v[ind-1] == v[ind+1]) {
				if(v[ind] == v[ind-1]) {
					s[0]++;
					s[1]++;
					v[ind] = 1 - v[ind];
				}else{
					s[0]--;
					s[1]--;
					v[ind] = 1 - v[ind];
				}
			}else{
				v[ind] = 1 - v[ind];
			}
		}

		//cerr << "\ns=" << s;

		cout << min(s[0], s[1]) << "\n"; 
	}

}

int main()
{
	std::ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	solve();

	return 0;
}