#include <bits/stdc++.h>
using namespace std;
int n, a, b, k;
const int N = 200011;
char s[N];
pair<int, int> e[N];
vector<int> res;
int main() {
  scanf("%d%d%d%d", &n, &a, &b, &k);
  scanf("%s", s + 1);
  int n = strlen(s + 1);
  int last = 0, tot = 0;
  for (int i = 1; i <= n + 1; i++) {
    if (i == n + 1 || s[i] == '1') {
      if (i - 1 >= last + 1) e[++tot] = make_pair(last + 1, i - 1);
      last = i;
    }
  }
  int cnt = 0, now;
  for (int i = 1; i <= tot; i++) cnt += (e[i].second - e[i].first + 1) / b;
  res.clear();
  now = 1;
  while (cnt >= a && now <= tot) {
    if (e[now].second - e[now].first + 1 >= b) {
      res.push_back(e[now].first + b - 1);
      e[now].first = e[now].first + b;
      cnt--;
    } else
      now++;
  }
  printf("%d\n", res.size());
  for (int i = 0; i < res.size(); i++) printf("%d ", res[i]);
}
