#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<int> v;
vector<pair<int, int> > s;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int n, i, a, b, k;
  cin >> n >> a >> b >> k;
  string str;
  cin >> str;
  for (i = 0; i < n; i++) {
    if (str[i] == '0') v.push_back(i);
  }
  for (i = 0; i < v.size(); i++) {
    int start = v[i];
    int j;
    for (j = i; j < v.size() - 1; j++) {
      if (v[j] + 1 == v[j + 1])
        continue;
      else
        break;
    }
    s.push_back(make_pair(start, v[j]));
    i = j;
  }
  int cur = 0;
  for (i = 0; i < s.size(); i++) {
    cur += (s[i].second - s[i].first + 1) / b;
  }
  vector<int> sol;
  while (cur >= a) {
    pair<int, int> ff = s.back();
    s.pop_back();
    if ((ff.second - ff.first + 1) / b == 0) continue;
    sol.push_back(ff.first + b - 1);
    s.push_back(make_pair(ff.first + b, ff.second));
    cur--;
  }
  cout << sol.size() << endl;
  for (i = 0; i < sol.size(); i++) {
    cout << sol[i] + 1 << " ";
  }
  return 0;
}
