#include <bits/stdc++.h>
const int INF = 0x3f3f3f3f;
const int N = 200010;
using namespace std;
int n, a, b, k, loc[N], cnt;
char f[N];
int main() {
  cin >> n >> a >> b >> k;
  int sum = 0;
  cin >> (f + 1);
  for (int i = 1; i <= n; i++) {
    if (f[i] == '1') {
      sum = 0;
      continue;
    }
    sum++;
    if (sum == b) {
      loc[++cnt] = i;
      sum = 0;
    }
  }
  cout << cnt - a + 1 << "\n";
  for (int i = 1; i <= cnt - a + 1; i++) {
    cout << loc[i] << " ";
  }
  return 0;
}
