#include <bits/stdc++.h>
using namespace std;
const int N = 222222;
char s[N];
int main() {
  int n, a, b, k;
  scanf("%d%d%d%d", &n, &a, &b, &k);
  gets(s);
  gets(s);
  s[n] = '1';
  vector<int> st, en;
  for (int i = 0; i <= n; i++) {
    if (s[i] == '0') {
      int j = i;
      for (; j <= n && s[j] == '0'; j++)
        ;
      st.push_back(i);
      en.push_back(j);
      i = j;
    }
  }
  int cnt = 0;
  for (int i = (0); i <= (int((int)(st.size())) - 1); i++) {
    cnt += (en[i] - st[i]) / b;
  }
  cnt = cnt - a + 1;
  vector<int> ans;
  for (int i = (0); i <= (int((int)(st.size())) - 1); i++) {
    if (cnt) {
      for (; en[i] - st[i] >= b && cnt > 0; st[i] += b) {
        ans.push_back(st[i] + b - 1);
        cnt--;
      }
    }
  }
  printf("%d\n", (int)(ans.size()));
  for (int i = (0); i <= (int((int)(ans.size())) - 1); i++) {
    if (i) printf(" ");
    printf("%d", ans[i] + 1);
  }
  puts("");
  return 0;
}
