#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, b, k;
  scanf("%d%d%d%d", &n, &a, &b, &k);
  string s;
  cin >> s;
  s += '1';
  set<pair<int, int> > v;
  int cnt = 0, st = -1;
  int tot = 0;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '0') {
      if (st == -1) st = i;
      cnt++;
    } else {
      if (cnt) v.insert(make_pair(cnt, st));
      tot += cnt / b;
      cnt = 0;
      st = -1;
    }
  }
  vector<int> res;
  while (v.size()) {
    int cur = (*v.rbegin()).first;
    st = (*v.rbegin()).second;
    if (tot < a) break;
    v.erase(make_pair(cur, st));
    tot -= cur / b;
    res.push_back(st + b);
    if (cur - b > 0) v.insert(make_pair(cur - b, st + b)), tot += (cur - b) / b;
  }
  printf("%d\n", int(res.size()));
  for (int i = 0; i < res.size(); i++) printf("%d ", res[i]);
  printf("\n");
  return 0;
}
