#include <bits/stdc++.h>
using namespace std;
unsigned long long int expo_fast(long long int a, long long int b) {
  a = a;
  long long int result = 1;
  while (b) {
    if (b & 1) result = (result * a);
    b >>= 1;
    a = (a * a);
  }
  return (result);
}
void take_in(vector<long long int> *arr) {
  for (int i = 0; i < arr->size(); i++) cin >> (*(arr))[i];
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
unsigned long long int power(long long int x, unsigned long long int y,
                             long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long int n, a, b, k;
bool cmp(const pair<long long int, pair<long long int, long long int>> &x,
         const pair<long long int, pair<long long int, long long int>> &y) {
  return (x.first % b) < (y.first % b);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> a >> b >> k;
  string s;
  cin >> s;
  vector<pair<long long int, pair<long long int, long long int>>> arr(0);
  if (k == 0) {
    long long int cur = n / b, cut = cur - a + 1;
    cout << cut << "\n";
    long long int ptr = b;
    for (int i = 0; i < cut; i++) {
      cout << ptr << " ";
      ptr += b;
    }
  } else {
    vector<long long int> indx, tmp_diff, ans;
    for (int i = 1; i <= n; i++)
      if (s[i - 1] == '1') {
        indx.push_back(i);
      }
    for (int i = 0; i < indx.size(); i++) {
      if (i == 0) {
        if (indx[i] > 1) arr.push_back({indx[i] - 1, {1, indx[i] - 1}});
      }
      if (i == indx.size() - 1) {
        if (indx[i] < n) arr.push_back({n - indx[i], {indx[i] + 1, n}});
      }
      if (i && indx[i] - indx[i - 1] > 1) {
        arr.push_back(
            {indx[i] - indx[i - 1] - 1, {indx[i - 1] + 1, indx[i] - 1}});
      }
    }
    long long int m = arr.size(), x = 0;
    for (auto x : arr) tmp_diff.push_back(x.first);
    for (auto q : arr) x += (q.first / b);
    bool done = (x < a);
    for (int i = 0; i < m && !done; i++) {
      if (arr[i].first < b) continue;
      if (x - a + 1 > (arr[i].first / b)) {
        long long int val = arr[i].first / b;
        x -= val;
        arr[i].first -= val;
      } else {
        long long int val = x - a + 1;
        arr[i].first -= val;
        x = a - 1;
      }
    }
    for (int i = 0; i < m; i++) {
      long long int ptr = arr[i].second.first + b - 1;
      for (int j = 0; j < tmp_diff[i] - arr[i].first; j++) {
        ans.push_back(ptr);
        ptr += b;
      }
    }
    cout << ans.size() << "\n";
    for (auto x : ans) cout << x << " ";
  }
}
