#include <bits/stdc++.h>
using namespace std;
int ar[200010];
vector<int> ans;
void solve() {
  int n, a, b, k, cnt = 0;
  cin >> n >> a >> b >> k;
  string s;
  cin >> s;
  int nxt = n + 1;
  for (int i = n; i > 0; i--) {
    if (s[i - 1] == '1') {
      cnt += (nxt - i - 1) / b;
      nxt = i;
    }
    ar[i] = nxt;
  }
  cnt += (nxt - 1) / b;
  int last = 0;
  if (cnt < a) {
    printf("0\n");
    return;
  }
  for (int i = 1; i <= n; i++) {
    if (s[i - 1] == '1') {
      last = i;
      continue;
    }
    if (i - last == b) {
      cnt--;
      ans.push_back(i);
      last = i;
      if (cnt < a) break;
    }
  }
  printf("%d\n", ans.size());
  for (int i = 0; i < ans.size(); i++) {
    printf("%d ", ans[i]);
  }
  printf("\n");
}
int main() {
  int t = 1;
  for (int i = 1; i <= t; i++) {
    solve();
  }
}
