#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
template <class T>
inline T isqrt(T k) {
  T r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
template <class T>
inline T icbrt(T k) {
  T r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
int n, a, b, k;
string s;
void solve() {
  cin >> n >> a >> b >> k >> s;
  vector<pair<int, int> > v;
  int st = -1;
  for (int i = (0); i < (n); i++) {
    if (s[i] == '1') {
      if (st != -1) {
        v.push_back(make_pair(st, i - st));
        st = -1;
      }
    } else if (st == -1) {
      st = i;
    }
  }
  if (st != -1) {
    v.push_back(make_pair(st, n - st));
  }
  long long can = 0;
  for (int i = (0); i < (int((v).size())); i++) {
    can += v[i].second / b;
  }
  long long tot = can - a + 1;
  vector<int> ans;
  for (int i = 0; i < int((v).size()) && tot > 0; i++) {
    int st = v[i].first;
    int len = v[i].second;
    for (int j = st; tot > 0 && j + b - 1 <= st + len - 1; j += b) {
      ans.push_back(j + b - 1);
      tot--;
    }
  }
  cout << int((ans).size()) << "\n";
  for (int i = (0); i < (int((ans).size())); i++)
    cout << ans[i] + 1 << " \n"[i == int((ans).size()) - 1];
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
