#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INF64 = 0x3f3f3f3f3f3f3f3f;
const int N = 2e5 + 10;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, a, b, k;
  cin >> n >> a >> b >> k;
  string s;
  cin >> s;
  vector<pair<int, int> > seg;
  int sum = 0;
  for (int i = 0; i < n; ++i) {
    if (s[i] == '1') continue;
    int j = i;
    while (j < n && s[j] == '0') ++j;
    if ((j - i) / b > 0) {
      seg.emplace_back(i, j);
      sum += (j - i) / b;
    }
    i = j;
  }
  vector<int> ans;
  for (int i = 0; i < seg.size(); ++i) {
    if (sum < a) break;
    for (int j = seg[i].second - b; sum >= a && j >= seg[i].first; j -= b) {
      ans.push_back(j);
      --sum;
    }
  }
  cout << ans.size() << '\n';
  for (auto i : ans) cout << i + 1 << ' ';
  cout << '\n';
  return 0;
}
