#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5 + 1000;
vector<pair<int, int> > lst;
char S[MAX_N];
int main() {
  int n, a, b, k, cnt = 0;
  scanf("%d%d%d%d\n", &n, &a, &b, &k);
  gets(S);
  S[n++] = '1', S[n] = 0;
  int last = -1;
  for (int i = 0; i < (n); ++i)
    if (S[i] == '1') {
      if (i && S[i - 1] != '1') lst.push_back(make_pair(last + 1, i));
      last = i;
    }
  vector<int> ans;
  for (const auto &p : lst) {
    int l = p.first, r = p.second, len = r - l;
    cnt += len / b;
    for (int i = l + b - 1; i < r; i += b) ans.push_back(i);
  }
  int z = cnt - a + 1;
  printf("%d\n", z);
  for (int i = 0; i < (z); ++i) printf("%d ", ans[i] + 1);
  puts("");
  return 0;
}
