#include <bits/stdc++.h>
using namespace std;
char _;
const int maxN = 200 * 1000 + 5;
const int mod = 1000 * 1000 * 1000 + 7;
const int maxL = 20;
int p[maxN];
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, a, b, k;
  cin >> n >> a >> b >> k;
  int ps = -1;
  vector<pair<int, int> > seg;
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    char c;
    cin >> c;
    if (c == '1') {
      cnt += (i - ps - 1) / b;
      if (i - ps - 1 >= b) seg.push_back(make_pair(ps + 1, i));
      ps = i;
    }
  }
  cnt += (n - ps - 1) / b;
  if (n - ps - 1 >= b) seg.push_back(make_pair(ps + 1, n));
  cout << cnt - a + 1 << endl;
  cnt -= a - 1;
  while (cnt) {
    int x = seg.back().first, y = seg.back().second;
    if (y - x < b) {
      seg.pop_back();
      continue;
    }
    cout << x + b << ' ';
    cnt--;
    seg.back().first = x + b;
  }
  cout << endl;
  return 0;
}
