#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
  long long res = 1LL;
  x = x % 1000000007;
  while (y > 0) {
    if (y & 1) res = (res * x) % 1000000007;
    y = y >> 1;
    x = (x * x) % 1000000007;
  }
  return res % 1000000007;
}
long long inv(long long n) { return power(n, 1000000007 - 2) % 1000000007; }
void solve() {
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  string s;
  cin >> s;
  s = " " + s;
  s[0] = '1';
  long long i = 0, tot = 0;
  vector<pair<long long, long long> > v;
  while (i <= n) {
    if (s[i] == '1') {
      i++;
      continue;
    }
    long long c = 0, j = i - 1;
    while (i <= n && s[i] == '0') i++, c++;
    if (c >= b) {
      v.push_back({j, c});
      tot += c / b;
    }
  }
  vector<long long> ans;
  for (auto x : v) {
    long long pos = b;
    while (x.second >= b && tot >= a) {
      ans.push_back(x.first + pos);
      pos += b;
      x.second -= b;
      tot--;
    }
  }
  cout << ans.size() << "\n";
  for (auto x : ans) cout << x << " ";
  cout << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
  }
}
