#include <bits/stdc++.h>
using namespace std;
int n, a, b, k, m, qu[200005];
pair<int, int> st[200005];
bool F[200005];
char s[200005];
bool cmp(pair<int, int> u, pair<int, int> v) { return u.second < v.second; }
int main() {
  scanf("%d%d%d%d", &n, &a, &b, &k);
  scanf("%s\n", s + 1);
  int bot = 1, re = 0;
  for (int i = 1; i < b; ++i)
    if (s[i] == '1') qu[++re] = i;
  for (int i = b; i <= n; ++i) {
    if (s[i] == '1') qu[++re] = i;
    if (re - bot == -1) {
      ++m;
      st[m].first = i;
      st[m].second = 1;
      qu[++re] = i;
      s[i] = '1';
    }
    if (bot <= re && i - b + 1 == qu[bot]) ++bot;
  }
  int x = 0;
  for (int i = 1; i <= m; ++i) {
    if (x + st[i].second >= a) {
      printf("%d\n", m - i + 1);
      for (int j = i; j <= m; ++j) printf("%d ", st[j].first);
      break;
    }
    x += st[i].second;
  }
  return 0;
}
