#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
ll A;
string S;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>A>>S;
	int C[2]={};
	//とりあえず2周
	ll cur=0;
	
	FOR(i,N) {
		if(S[i]=='0') {
			cur++;
		}
		else {
			if(cur) {
				cur--;
				A--;
			}
		}
		if(A==0) {
			cout<<i+1<<endl;
			return;
		}
	}
	vector<int> cand;
	FOR(i,N) {
		if(S[i]=='0') {
			cur++;
		}
		else {
			if(cur) {
				cand.push_back(i+1);
				cur--;
				A--;
			}
		}
		if(A==0) {
			cout<<N+i+1<<endl;
			return;
		}
	}
	ll step=2*N;
	ll a=(A-1)/cand.size();
	step+=N*a;
	A-=a*cand.size();
	cout<<step+cand[A-1]<<endl;
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}