#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
const int MAXN = 200000;
int n, scnt, slen, shots;
char s[MAXN + 1];
int ret[MAXN], nret;
void run() {
  scanf("%d%d%d%d%s", &n, &scnt, &slen, &shots, s);
  nret = 0;
  for (int at = 0, to = at; at < n; at = to) {
    to = at + 1;
    if (s[at] == '1') continue;
    while (to < n && s[to] == '0') ++to;
    int len = to - at, mx = len / slen;
    for (int i = (0); i < (mx); ++i) ret[nret++] = at + slen - 1 + i * slen;
  }
  nret = max(0, nret - (scnt - 1));
  printf("%d\n", nret);
  for (int i = (0); i < (nret); ++i) {
    if (i != 0) printf(" ");
    printf("%d", ret[i] + 1);
  }
  puts("");
}
int main() {
  run();
  return 0;
}
