#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 100;

int pref_sum[maxn];

int sum(int i, int j) {
    if(i == 0) {
        return pref_sum[j];
    }
    return pref_sum[j] - pref_sum[i - 1];
}
int main() {
    int n, k;
    cin >> n >> k;

    vector<int> v(n);

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

        v[i] = 1 - v[i];
        s += v[i];
        pref_sum[i] = s;
    }
    int res = 0;
    int start_idx = -1;
    for(int i = 0; i < n; i++) {
        int L = i + 1, R = n - 1;

        while(L <= R) {
            int middle = (L + R) / 2;
            if(sum(i, middle) <= k) {
                if(res < middle - i + 1) {
                    res = middle - i + 1;
                    start_idx = i;
                }
                L = middle + 1;
            }
            else {
                R = middle - 1;
            }
        }
    }

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