#include <bits/stdc++.h>
using namespace std;
template <typename T>
T sqr(T x) {
  return x * x;
}
inline unsigned long long bit(int num) { return 1ull << num; }
int main() {
  int n, a, b, k;
  cin >> n >> a >> b >> k;
  string field;
  cin >> field;
  vector<int> v(n, 0);
  for (int i = 0; i < int(n); ++i) {
    v[i] = field[i] != '0';
  }
  int last = -1;
  vector<int> poss;
  for (int i = 0; i < int(n); ++i) {
    int len = i - last - 1;
    if (v[i]) {
      last = i;
    } else {
      if (len % b == b - 1) poss.push_back(i);
    }
  }
  int res = poss.size() - a + 1;
  cout << res << endl;
  for (int i = 0; i < int(res); ++i) {
    cout << poss[i] + 1 << " ";
  }
  cout << endl;
  return 0;
}
