n,k=map(int,input().split())
s=input()
m=min([max(s.find(c),0) for c in "12"])+1

u=max(len(s)-sum(map(int,s)),0)

cost=k//n*u
costu=0
prize=0
for c in s[:k%n]:
    if prize>0: prize-=1
    else:       costu+=1
    if c!="0":  prize+=int(c)

print(cost+max(costu,1))