#include <bits/stdc++.h>
using namespace std;
queue<int> q;
int n, a, b, k, num = 0, ans = 0, flag = 0;
char s[200050];
int main() {
  scanf("%d %d %d %d", &n, &a, &b, &k);
  scanf("%s", s);
  int len = strlen(s);
  for (int i = 0; i < len; i++) {
    if (s[i] == '0')
      num++;
    else
      num = 0;
    if (num >= b) {
      num -= b;
      ans++;
      q.push(i + 1);
    }
  }
  int k = ans - a + 1;
  printf("%d\n", k);
  for (int i = 1; i <= k; i++) {
    if (i == 1)
      printf("%d", q.front());
    else
      printf(" %d", q.front());
    if (!q.empty()) q.pop();
  }
  printf("\n");
}
