#include <bits/stdc++.h>
using namespace std;
char s[200005];
int res[200005], l[200005], r[200005], d[200005];
inline bool cmp(const int &x, const int &y) {
  return r[x] - l[x] < r[y] - l[y];
}
int main() {
  int n, m = 0, a, b, c = 0, i, j = 0, k, p, last;
  scanf("%d%d%d%d%s", &n, &a, &b, &k, s + 1);
  s[++n] = '1';
  last = 0;
  for (i = 1; i <= n; ++i)
    if (s[i] == '1') {
      if (i - last > b) {
        l[j] = last;
        r[j] = i;
        d[j] = j;
        ++j;
        c += (i - last - 1) / b;
      }
      last = i;
    }
  sort(d, d + j, cmp);
  for (i = 0; i < j; ++i) {
    k = d[i];
    if (c - (r[k] - l[k] - 1) / b < a) {
      c = a - (c - (r[k] - l[k] - 1) / b);
      for (p = l[k] + b; p < r[k]; p += b) {
        res[m++] = p;
        if ((r[k] - p - 1) / b < c) break;
      }
      break;
    } else {
      for (p = l[k] + b; p < r[k]; p += b) res[m++] = p;
      c -= (r[k] - l[k] - 1) / b;
    }
  }
  printf("%d\n", m);
  for (i = 0; i < m; ++i) printf("%d ", res[i]);
}
