#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
char str[N];
int arr[N], sums[N];
int L[N], R[N];
int main() {
  int n, a, b, k;
  scanf("%d %d %d %d", &n, &a, &b, &k);
  scanf("%s", str);
  for (int i = 1; i <= n; i++) {
    arr[i] = str[i - 1] - '0';
    sums[i] = sums[i - 1] + (arr[i] ^ 1);
  }
  priority_queue<pair<int, pair<int, int>>> pq;
  int curr = 0, prev = 0, x, l, r, m;
  for (int i = 1; i <= n + 1; i++) {
    if (i == n + 1 || arr[i] == 1) {
      x = i - prev - 1;
      x /= b;
      if (x > 0) {
        pq.push({-1 * (i - prev - 1), {prev + 1, i - 1}});
        curr += x;
      }
      prev = i;
    }
  }
  vector<int> ans;
  pair<int, pair<int, int>> temp;
  int a1, a2;
  while (curr >= a) {
    temp = pq.top();
    pq.pop();
    l = temp.second.first, r = temp.second.second;
    x = r - l + 1;
    x /= b;
    int f = (x + 1) / 2;
    curr -= x;
    f *= b;
    m = (l + f - 1);
    a1 = m - 1;
    a2 = m + 1;
    ans.push_back(m);
    if (a1 >= l) {
      x = a1 - l + 1;
      x /= b;
      if (x > 0) {
        curr += x;
        pq.push({-1 * (a1 - l + 1), {l, a1}});
      }
    }
    if (a2 <= r) {
      a1 = r, l = a2;
      x = a1 - l + 1;
      x /= b;
      if (x > 0) {
        curr += x;
        pq.push({-1 * (a1 - l + 1), {l, a1}});
      }
    }
  }
  printf("%d\n", ans.size());
  for (auto c : ans) {
    printf("%d ", c);
  }
  return 0;
}
