#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200010;
char s[MAXN];
int main() {
  int n, a, b, k;
  scanf("%d %d %d %d", &n, &a, &b, &k);
  scanf("%s", s + 1);
  int cnt = 0;
  vector<pair<int, int> > seqs;
  for (int i = 1; i <= n; i++) {
    if (s[i] == '0')
      cnt++;
    else {
      if (cnt > 0) seqs.push_back(make_pair(i - cnt, cnt));
      cnt = 0;
    }
  }
  if (cnt > 0) seqs.push_back(make_pair(n + 1 - cnt, cnt));
  int ships = 0;
  for (auto x : seqs) ships += x.second / b;
  vector<int> pozicije;
  for (auto x : seqs) {
    for (int st = x.first + b - 1; st <= x.first + x.second - 1; st += b)
      pozicije.push_back(st);
  }
  int nd = ships - a + 1;
  printf("%d\n", nd);
  for (int i = 0; i < nd; i++) printf("%d ", pozicije[i]);
  printf("\n");
  return 0;
}
