N,Q = map(int,input().split())
sor = input()
#sor = "001110101001110"
if sor[0] == "0":
    db0 = 1
    db1 = 0
else:
    db1 = 1
    db0 = 0
for i in range(1,N):
    if sor[i] != sor[i-1]:
        if sor[i] == "0":
            db0 += 1
        else:
            db1 += 1
lista = list(sor)
megoldas = [min([db0,db1])]
#print(lista,db0,db1)
for eset in range(Q):
    K = int(input())
    if K > 1 and K < N:
        resz = "".join(lista[K-2:K+1])
        if resz in ["000","111"]:
            db0 +=1
            db1 +=1
        elif resz in ["101","010"]:
            db0 -= 1
            db1 -= 1
    elif K == 1:
        resz = "".join(lista[:2])
        if resz == "00":
            db1 += 1
        elif resz == "11":
            db0 += 1
        elif resz == "10":
            db1 -= 1
        elif resz == "01":
            db0 -= 1
    elif K == N:
        resz = "".join(lista[-2:])
        if resz == "00":
            db1 += 1
        elif resz == "11":
            db0 += 1
        elif resz == "10":
            db0 -= 1
        elif resz == "01":
            db1 -= 1
    if lista[K-1] == "0":
        lista[K-1] = "1"
    else:
        lista[K-1] = "0"
    megoldas.append(min([db0,db1]))
    #print(lista,db0,db1)
for x in megoldas:
    print(x)