#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;


int main() {
    int n, k;
    cin >> n >> k;

    vector<int> v(n);
    for(int i = 0; i < n; i++) {
        cin >> v[i];
    }
    vector<int> idx;

    int res = 0;
    int j = 0;
    int sum = 0;
    int start_idx = 0, end_idx = 0;
    for(int i = 0; i < n; i++) {
        while(j < n and sum + (1 - v[j]) <= k) {
            sum += (1 - v[j]);
            j++;

        }

        if(res < j - i) {
            res = j - i;
            start_idx = i;
            end_idx = j;
        }
        sum -= (1 - v[i]);
    }
    cout << res << endl;
    for(int i = start_idx; i < end_idx; i++) {
        if(v[i] == 0) {
            cout << i + 1 << " ";
        }
    }


    return 0;
}