#include <bits/stdc++.h>
using namespace std;
const int IMX = (1 << 31) - 1;
const long long LMX = (1ll << 63) - 1;
const long double PI = 3.141592653589793;
const int eps = 1e-10;
const int base = 1e9;
const int N = 200005;
char c[N];
int a[N], d[N];
vector<pair<int, pair<int, int> > > v;
vector<int> ans;
int main() {
  int n, A, b, k;
  cin >> n >> A >> b >> k;
  scanf("%s", &c);
  int l = 0, r = 0;
  for (int i = 0; i < n; i++) {
    a[i + 1] = int(c[i] - '0');
    a[i + 1]++;
    a[i + 1] %= 2;
  }
  int all = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] == 1) {
      l = r = i;
      while (a[r]) r++;
      r--;
      i = r;
      d[(int)v.size()] = (r - l + 1) / b;
      all += (r - l + 1) / b;
      v.push_back(make_pair(r - l + 1, make_pair(l, r)));
    }
  }
  sort(v.begin(), v.end());
  int cnt = 0, f = 0;
  for (int i = 0; i < v.size(); i++) {
    if (v[i].first >= b) {
      int l = v[i].second.first, r = v[i].second.second, cnt = v[i].first;
      for (int j = l + b - 1; j <= r; j += b) {
        if (all - ans.size() == A - 1) {
          f = 1;
          break;
        }
        ans.push_back(j);
      }
    }
    if (f) break;
  }
  cout << ans.size() << endl;
  for (int i = 0; i < ans.size(); i++) printf("%d ", ans[i]);
  cout << endl;
  return 0;
}
