#include <bits/stdc++.h>
using namespace std;
int n, a, b, k;
const int N = 200010;
char s[N];
int main() {
  while (scanf("%d%d%d%d", &n, &a, &b, &k) != EOF) {
    scanf("%s", s);
    int last = -1;
    vector<int> pos;
    for (int i = 0; i < n; i++) {
      if (s[i] == '1') {
        last = i;
      } else {
        if (i - last == b) {
          pos.push_back(i + 1);
          last = i;
        }
      }
    }
    for (int i = 0; i < a - 1; i++) {
      pos.pop_back();
    }
    printf("%d\n", pos.size());
    for (int i = 0, sz = pos.size(); i < sz; i++) {
      printf("%d%s", pos[i], i == sz - 1 ? "\n" : " ");
    }
  }
}
