#include <bits/stdc++.h>
using namespace std;
int n, a, b, k;
string s;
void read() {
  scanf("%d%d%d%d", &n, &a, &b, &k);
  cin >> s;
}
void solve() {
  vector<int> pos;
  for (int i = 0; i < n;) {
    for (; i < n && s[i] == '1'; i++)
      ;
    if (i == n) break;
    int j = i;
    for (; i < n && s[i] == '0'; i++)
      ;
    j += b - 1;
    for (; j < i; j += b) pos.push_back(j);
  }
  assert((int)pos.size() >= a);
  int res = (int)pos.size() - (a - 1);
  printf("%d\n", res);
  for (int i = 0; i < res; i++) printf("%d ", pos[i] + 1);
  puts("");
}
int main() {
  read();
  solve();
}
