#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pi = pair<int, int>;
const int mod = 1e9 + 7;
const ll inf = ll(1e18);
const double PI = acos(-1), eps = 1e-9;
const int mxa = 2e5;
const int mxn = 2e5, mxk = 5e2;
int n, a, b, k;
string second;
void solve() {
  cin >> n >> a >> b >> k >> second;
  int cnt = 0;
  set<pi> st;
  for (int i = 0; i < n;) {
    if (second[i] == '1') {
      ++i;
      continue;
    }
    int len = 0;
    while (i < n && second[i] == '0') {
      ++len, ++i;
    }
    st.insert({i - len, len});
    cnt += len / b;
  }
  vi ans;
  for (const auto &p : st) {
    cnt -= p.second / b;
    if (cnt < a) {
      int need = a - cnt;
      for (int i = p.first + b - 1; i < p.first + p.second - need * b; i += b)
        ans.push_back(i);
      ans.push_back(p.first + p.second - need * b);
      break;
    } else {
      for (int i = p.first + b - 1; i < p.first + p.second; i += b)
        ans.push_back(i);
    }
  }
  cout << (int)(ans).size() << '\n';
  for (const int x : ans) cout << x + 1 << ' ';
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int tt;
  tt = 1;
  while (tt-- > 0) solve();
}
