n,k=map(int,input().split())
s=input()

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

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

print(max(cost,1))