N,Q = map(int,input().split())
sor = input()
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

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