#include <bits/stdc++.h>
using namespace std;
int n, a, b, k;
string s;
priority_queue<pair<int, pair<int, int> > > qu;
vector<int> ret;
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> a >> b >> k;
  cin >> s;
  s = s + '1';
  int ls = 0;
  int tot = 0;
  for (int i = 0; i < s.size(); i++)
    if (s[i] == '1') {
      if (i - ls >= b) {
        qu.push(make_pair(i - ls, make_pair(ls + 1, i)));
        tot += ((i - ls) / b);
      }
      ls = i + 1;
    }
  while (tot >= a) {
    int len = qu.top().first;
    int l = qu.top().second.first;
    int r = qu.top().second.second;
    int pos = l + b - 1;
    ret.push_back(pos);
    int s1 = pos - l;
    int s2 = r - pos;
    qu.pop();
    tot = tot - (len / b) + (s1 / b) + (s2 / b);
    if (s1 >= b) {
      qu.push(make_pair(s1, make_pair(l, pos - 1)));
    }
    if (s2 >= b) {
      qu.push(make_pair(s2, make_pair(pos + 1, r)));
    }
  }
  cout << ret.size() << "\n";
  for (int i = 0; i < ret.size(); i++) cout << ret[i] << " ";
  return 0;
}
