#include <bits/stdc++.h>
using namespace std;
int n, a, b, k, ans = 0;
char str[200010];
queue<int> q;
int main() {
  cin >> n >> a >> b >> k >> str;
  int x = 0;
  for (int i = 0; i < n; i++) {
    if (str[i] == '0') x++;
    if (str[i] == '1') x = 0;
    if (x == b) {
      q.push(i + 1);
      ans++;
      x = 0;
    }
  }
  cout << ans - a + 1 << endl;
  int y = a - 1;
  while (y) {
    q.pop();
    y--;
  }
  bool f = 1;
  while (!q.empty()) {
    if (f) {
      f = 0;
      cout << q.front();
    } else
      cout << " " << q.front();
    q.pop();
  }
}
