#include <bits/stdc++.h>
using namespace std;
int n, a, b, K;
char S[262144];
int len[262144];
int p[262144];
int main() {
  scanf("%d%d%d%d", &n, &a, &b, &K);
  scanf("%s", S + 1);
  S[0] = S[n + 1] = '1';
  for (int i = 1; i <= n; ++i) {
    if (S[i] == '1')
      len[i] = 0;
    else
      len[i] = len[i - 1] + 1;
  }
  int count = 0;
  for (int i = 2; i <= n + 1; ++i)
    if (S[i] == '1') count += len[i - 1] / b;
  int ans = count - a + 1;
  printf("%d\n", ans);
  count = 0;
  int last = 0;
  for (int i = 1; i <= n; ++i) {
    if (S[i] == '1') {
      last = i;
    } else {
      if (i - last == b && count < ans) {
        p[++count] = i;
        last = i;
      }
    }
  }
  for (int i = 1; i <= ans; ++i) {
    printf("%d", p[i]);
    if (i == ans)
      printf("\n");
    else
      printf(" ");
  }
  return 0;
}
