#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
vector<long long> primeFact(long long n) {
  vector<long long> ans;
  for (long long t = 2; t <= sqrt(n); t++) {
    if (n % t == 0) {
      ans.push_back(t);
      while (n % t == 0) {
        n = n / t;
      }
    }
  }
  if (n > 2) ans.push_back(n);
  return ans;
}
vector<long long> fact(long long n) {
  vector<long long> ans;
  for (long long i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (i * i == n) {
        ans.push_back(i);
      } else {
        ans.push_back(i);
        ans.push_back(n / i);
      }
    }
  }
  return ans;
}
long long powerr(long long base, long long exp, long long mod) {
  if (exp == 0) return 1;
  long long t = powerr(base, exp / 2, mod) % mod;
  if (exp % 2 == 0) {
    return (t % mod * t % mod) % mod;
  } else {
    return (t % mod * t % mod * base % mod) % mod;
  }
}
void fastio() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
int32_t main() {
  fastio();
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  string s;
  cin >> s;
  s = " " + s;
  vector<long long> dp(n + 1, 0);
  vector<pair<long long, long long> > ans(n + 1);
  long long pos = -1;
  for (long long i = 1; i <= n; i++) {
    if (s[i] == '0') {
      pos++;
      ans[pos] = {i, 0};
      for (; i <= n; i++) {
        if (s[i] == '0') {
          ans[pos] = {ans[pos].first, ans[pos].second + 1};
        } else {
          break;
        }
      }
    }
  }
  deque<long long> fa;
  for (long long i = 0; i <= pos; i++) {
    for (long long j = ans[i].first + b - 1; j < ans[i].first + ans[i].second;
         j += b) {
      fa.push_back(j);
    }
  }
  for (long long i = 0; i < a - 1; i++) {
    fa.pop_front();
  }
  cout << fa.size() << "\n";
  for (long long i = 0; i < fa.size(); i++) {
    cout << fa[i] << " ";
  }
  cout << "\n";
  return 0;
}
