#include <bits/stdc++.h>
using namespace std;
int II() {
  int q;
  scanf("%d", &q);
  return q;
}
long long LII() {
  long long q;
  scanf("%lld", &q);
  return q;
}
bool bo[300005];
void solve() {
  int N, a, b, K;
  cin >> N >> a >> b >> K;
  string s;
  cin >> s;
  int ar[N + 10];
  for (int i = 1; i <= N; i++) {
    if (s[i - 1] == '0')
      ar[i] = 0;
    else
      ar[i] = 1;
  }
  int br[N + 10];
  br[0] = 0;
  for (int i = 1; i <= N; i++) {
    br[i] = br[i - 1] + ar[i];
  }
  int cnt = 2;
  for (int i = 1; i <= N - b + 1; i++) {
    if ((br[i + b - 1] - br[i - 1]) == 0) {
      if (a > 0) {
        int q = i + b - 1;
        while (i <= q) {
          ar[i] = cnt;
          i++;
        }
        i--;
        a--;
      }
    }
  }
  for (int i = 1; i <= N; i++) {
    if (ar[i] == 0) {
      br[i] = br[i - 1];
    } else
      br[i] = br[i - 1] + 1;
  }
  for (int i = 1; i <= N - b + 1; i++) {
    if ((br[i + b - 1] - br[i - 1]) == 0) {
      cnt++;
      int q = i + b - 1;
      while (i <= q) {
        ar[i] = cnt;
        i++;
      }
      i--;
    }
  }
  vector<int> v;
  for (int i = N; i >= 1; i--) {
    if (ar[i] > 1) {
      if (bo[ar[i]] == 0) {
        v.push_back(i);
        bo[ar[i]] = 1;
      }
    }
  }
  cout << v.size() << endl;
  sort(v.begin(), v.end());
  for (auto it : v) cout << it << " ";
  cout << endl;
}
int32_t main() {
  int tt;
  tt = 1;
  int cas = 1;
  while (tt--) {
    solve();
  }
}
