#include <bits/stdc++.h>
using namespace std;
int field[200001];
vector<pair<int, int> > seg;
int main() {
  int n, a, b, k;
  cin >> n >> a >> b >> k;
  string s;
  cin >> s;
  s.push_back('1');
  int lastpos = -1;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '1') {
      if (i - lastpos > 1) {
        seg.push_back({i - lastpos - 1, lastpos + 1});
      }
      lastpos = i;
    }
  }
  int ships = 0;
  for (int i = 0; i < seg.size(); i++) ships += (seg[i].first / b);
  int need = (ships - a + 1);
  cout << need << endl;
  for (int i = 0; i < seg.size(); i++) {
    int make = min(need, seg[i].first / b);
    need -= make;
    for (int j = 1; j <= make; j++) cout << seg[i].second + (j * b) << " ";
  }
  return 0;
}
