#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 123;
pair<int, int> x[MAXN];
vector<int> ans;
int main() {
  int n, a, b, k;
  cin >> n >> a >> b >> k;
  string s, t;
  s += '1';
  cin >> t;
  s += t + '1';
  n += 2;
  int tah1 = 0, j = 0, ted = 0;
  for (int i = 1; i < n; i++) {
    if (s[i] == '1') {
      x[j].first = (i - tah1 - 1) / b;
      ted += x[j].first;
      x[j].second = tah1;
      tah1 = i;
      j++;
    }
  }
  for (int i = 0; i < j; i++) {
    int ddd = b;
    while (ted >= a && x[i].first) {
      ans.push_back(x[i].second + ddd);
      ted--;
      x[i].first--;
      ddd += b;
    }
  }
  cout << ans.size() << "\n";
  for (auto u : ans) cout << u << " ";
  return 0;
}
