#include <bits/stdc++.h>
using namespace std;
const int N = 3e5;
int n, a, b, k;
char ch[N];
stack<pair<int, int> > ss;
vector<int> ans;
int main() {
  cin >> n >> a >> b >> k;
  scanf("%s", ch + 1);
  int st = 1, s = 0;
  for (int i = 1; i <= n + 1; i++)
    if (i == n + 1 || ch[i] == '1') {
      int len = i - st;
      if (len >= b) {
        ss.push(make_pair(st, len));
        s += len / b;
      }
      st = i + 1;
    }
  while (s >= a) {
    pair<int, int> t = ss.top();
    ss.pop();
    ans.push_back(t.first + t.second - b);
    t.second -= b;
    if (t.second >= b) ss.push(t);
    s--;
  }
  cout << ans.size() << endl;
  for (int i = 0; i < ans.size(); i++)
    printf("%d%c", ans[i], i == ans.size() - 1 ? '\n' : ' ');
  return 0;
}
