#include <bits/stdc++.h>
using namespace std;
int N, a, b, K;
string s;
vector<pair<int, int> > lengths;
int main(void) {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> N >> a >> b >> K >> s;
  --a;
  s += '1';
  int last = -1;
  for (int i = (0), _b = (s.size() - 1); i <= _b; i++)
    if (s[i] == '1')
      lengths.push_back(pair<int, int>((i - last - 1) / b, last)), last = i;
  int need = 0;
  K = lengths.size();
  for (int i = (0), _b = (K - 1); i <= _b; i++) need += lengths[i].first;
  need -= a;
  cout << need << endl;
  for (int rep = (1), _b = (need); rep <= _b; rep++) {
    while (lengths.back().first == 0) lengths.pop_back();
    lengths.back().second += b;
    --lengths.back().first;
    cout << lengths.back().second + 1 << " ";
  }
  cout << endl;
  return 0;
}
