#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
struct Node {
  int left, len;
} d[MAXN];
int n, a, b, k, num, side[MAXN];
char s[MAXN];
int main() {
  scanf("%d%d%d%d", &n, &a, &b, &k);
  scanf("%s", s + 1);
  s[n + 1] = '1';
  int l = 0;
  for (int i = 1; i <= n + 1; i++) {
    if (s[i] == '1') {
      if (l >= b) d[++num].len = l, d[num].left = i - l;
      l = 0;
    } else
      l++;
  }
  int ans = 0;
  a = a - 1;
  for (int i = 1; i <= n; i++) {
    if (a >= d[i].len / b)
      a -= d[i].len / b;
    else {
      for (int j = 1; j <= d[i].len / b - a; j++)
        side[++ans] = d[i].left + b * j - 1;
      a = 0;
    }
  }
  printf("%d\n", ans);
  for (int i = 1; i <= ans; i++) printf("%d ", side[i]);
}
