#include <bits/stdc++.h>
using namespace std;
int n, a, b, k;
string s;
int main() {
  cin >> n >> a >> b >> k >> s;
  s.push_back('1');
  n++;
  int u = -1, v = -1;
  vector<pair<int, int> > vec;
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    if (s[i] == '0') {
      if (u == -1) {
        u = i;
        v = i;
      } else
        v = i;
    } else {
      if (v != -1) {
        cnt += (v - u + 1) / b;
        vec.push_back(make_pair(u, v));
      }
      u = -1;
      v = -1;
    }
  }
  assert(cnt >= a);
  vector<int> ans;
  for (int i = 0; i < vec.size(); i++) {
    int B = vec[i].first + b - 1;
    while (B <= vec[i].second && cnt >= a) {
      ans.push_back(B + 1);
      B += b;
      cnt--;
    }
  }
  cout << ans.size() << endl;
  for (int i = 0; i < ans.size(); i++)
    printf("%d%c", ans[i], i == ans.size() - 1 ? '\n' : ' ');
}
