int traffic(int n, int m, vector<int> v) {
	int ans=0;
	for(int i=0;i<n;i++){
        int j=i;
		int t=0;
        while(j<n){
            if(v[j]==0){
              if (m > 0) {
                m--;
				t++;
              }
            }
			else{
				t++;
			}
            j++;
        }
        ans=max(ans,t);
    }
    return ans;
}

#include <bits/stdc++.h>
using namespace std;
int traffic(int n, int m, vector<int> v) {
	int ans=0;
	for(int i=0;i<n;i++){
        int j=i;
		int t=0;
        while(j<n){
            if(v[j]==0){
              if (m > 0) {
                m--;
				t++;
              }
            }
			else{
				t++;
			}
            j++;
        }
        ans=max(ans,t);
    }
    return ans;
}


int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    while (t--)
    {
        int n, m;
        cin >> n >> m;

3 1
0 1 1

6 3
0 1 0 0 1 0

25 17
1 0 1 1 1 1 1 0 1 0 1 1 1 0 0 1 0 0 1 0 0 0 1 1 0

36 32
0 1 1 0 1 0 0 1 1 1 1 1 0 1 0 0 0 0 0 0 1 1 1 1 1 1 0 0 1 1 1 1 1 0 0 0

781 318
0 1 0 1 1 1 1 1 0 1 0 1 1 1 0 0 1 0 0 1 0 0 0 1 1 0 1 1 0 0 0 0 0 0 1 1 0 1 1 1 1 0 1 0 1 1 0 1 0 0 0 0 1 1 0 1 1 1 1 0 1 1 0 1 0 0 1 1 1 1 1 0 1 0 0 0 0 0 0 1 1 1 1 1 1 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 0 0 0 1 0 0 0 1 1 1 1 0 1 0 0 1 1 0 0 0 0 1 0 0 0 1 1 1 0 1 0 0 0 0 0 0 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 0 0 0 1 1 1 1 0 1 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 1 1 1 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 1 1 0 1 0 0 0 0 1 0 1 0 1 0 1 1 0 1 1 1 0 1 1 0 1 0 1 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 1 1 1 0 0 1 0 0 1 0 0 1 0 0 0 0 1 0 1 0 0 1 0 0 1 1 0 0 0 1 0 1 0 1 1 1 1 0 1 1 0 1 1 1 1 1 0 1 0 1 0 0 1 0 1 1…

            if(v[j]==0){
              if (m > 0) {
                m--;
		t++;
              }
            }