#include <bits/stdc++.h>
char s[200005];
int res[200005];
int ptr;
int main() {
  int n, a, b, k;
  scanf("%d%d%d%d", &n, &a, &b, &k);
  scanf("%s", s);
  int cons = 0;
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    if (s[i] == '0') cons++;
    if (s[i] == '1') {
      cnt += cons / b;
      cons = 0;
    }
  }
  cnt += cons / b;
  cons = 0;
  for (int i = 0; i < n; i++) {
    if (s[i] == '0')
      cons++;
    else
      cons = 0;
    if (cons == b && cnt > a - 1) {
      res[ptr++] = i + 1;
      cons = 0;
      cnt--;
    }
  }
  printf("%d\n", ptr);
  for (int i = 0; i < ptr; i++) printf("%d ", res[i]);
  return 0;
}
