#include <bits/stdc++.h>
using namespace std;
const int N = 200004;
char s[N];
int l[N], r[N], n, a, b, k, p = 0, ans[N], x = 0;
int main() {
  scanf("%d %d %d %d %s", &n, &a, &b, &k, s + 1);
  for (int i = 1, j; i <= n;) {
    if (s[i] == '0') {
      for (j = i + 1; j <= n && s[j] == '0'; j++)
        ;
      l[++p] = i;
      r[p] = j - 1;
      i = j;
    } else
      i++;
  }
  for (int i = 1; i <= p; i++)
    for (int j = l[i] + b - 1; j <= r[i]; j += b) ans[++x] = j;
  x -= a - 1;
  printf("%d\n", x);
  for (int i = 1; i <= x; i++) printf("%d%c", ans[i], " \n"[i == x]);
}
