#include <bits/stdc++.h>
using namespace std;
long long pow(long long a, long long b, long long M) {
  long long t = 1;
  for (a %= M; b; b >>= 1) {
    if (b & 1) t = t * a % M;
    a = a * a % M;
  }
  return t;
}
int n, a, b, k, ans, cnt;
char c[233444];
int main() {
  cin >> n >> a >> b >> k;
  scanf("%s", c + 1);
  c[0] = c[n + 1] = '1';
  for (int i = 0, j; i <= n; i = j) {
    j = i + 1;
    while (c[j] != '1') {
      if ((j - i) % b == 0) cnt++;
      j++;
    }
  }
  cout << (ans = cnt - a + 1) << endl;
  for (int i = 0, j; ans > 0 && i <= n; i = j) {
    j = i + 1;
    while (c[j] != '1' && ans) {
      if ((j - i) % b == 0) cout << j << ' ', ans--;
      j++;
    }
  }
}
