#include using namespace std; #define int long long #define rep(i,s,n) for(int i = s;i=(s);i--) #define all(v) (v).begin(),(v).end() #define pb push_back #define fi first #define se second #define chmin(a,b) a=min((a),(b)) #define chmax(a,b) a=max((a),(b)) typedef long long ll; typedef pairpint; typedef vectorvint; typedef vectorvpint; typedef pair P1; typedef pair P2; typedef pairPP; static const ll maxLL = (ll)1 << 62; const ll MOD=1000000007; const ll INF=1e18; int dx[]={0,0,1,-1}; int dy[]={-1,1,0,0}; int N,K,x,y; string s; void hakogai(){ int stock=0,cost=0,i; rep(i,0,N){ if(stock>0)stock--; else cost++; stock+=s[i]-'0'; } x=cost; y=stock; } int hasuu(int rest,int stock){ int cost=0,i; rep(i,0,rest){ if(stock>0)stock--; else cost++; stock+=s[i]-'0'; } return cost; } signed main(){ cin.tie(0); ios::sync_with_stdio(false); cin>>N>>K>>s; if(K