#include <bits/stdc++.h>
using namespace std;
int n, m, l, K;
pair<int, int> p[1111111];
vector<int> ans;
char str[1111111];
int main() {
  scanf("%d%d%d%d", &n, &m, &l, &K);
  scanf(" %s", str + 1);
  str[0] = str[n + 1] = '1';
  int last = 0, sum = 0, cnt = 0;
  for (int i = 1; i <= n + 1; ++i)
    if (str[i] == '1') {
      int len = i - 1 - last;
      p[++cnt] = make_pair(last + 1, len);
      sum += len / l;
      last = i;
    }
  ans.clear();
  for (int i = 1; i <= n && sum >= m; ++i) {
    while (p[i].second >= l && sum >= m) {
      int len = p[i].second, s = p[i].first;
      sum -= len / l;
      int step = max(1, len % l);
      if (l == 1) step = 0;
      ans.push_back(s + step);
      p[i].first = s + step + 1;
      p[i].second -= step + 1;
      sum += p[i].second / l;
    }
  }
  if ((int)ans.size() == 0) {
    for (int i = 1; i <= n; ++i)
      if (str[i] == '0') {
        ans.push_back(i);
        break;
      }
  }
  cout << ans.size() << endl;
  for (int i = 0; i < ans.size(); ++i) printf("%d ", ans[i]);
  cout << endl;
}
