#include <bits/stdc++.h>
using namespace std;
int n, a, b, k;
vector<pair<int, int> > v;
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> a >> b >> k;
  int l = 0;
  for (int i = 1; i <= n; ++i) {
    char q;
    cin >> q;
    if (q == '1') {
      if (l + 1 != i) v.push_back(make_pair(i - 1 - l, l + 1));
      l = i;
    }
  }
  if (l != n) v.push_back(make_pair(n - l, l + 1));
  sort(v.begin(), v.end());
  int all = 0;
  for (int i = 0; i < v.size(); ++i) all += v[i].first / b;
  int r = v.size() - 1;
  vector<int> ans;
  while (all >= a) {
    while (r >= 0 && v[r].first < b) --r;
    --all;
    ans.push_back(v[r].second + b - 1);
    v[r].second += b;
    v[r].first -= b;
  }
  cout << ans.size() << '\n';
  for (int i = 0; i < ans.size(); ++i) cout << ans[i] << ' ';
}
