#include <bits/stdc++.h>

using namespace std;
template<typename T> void umin(T &a, T b) {a = min(a, b);}

long double randomFloat() {
  return (long double)rand() / RAND_MAX;
}

int main() {
  cin.tie(0)->sync_with_stdio(false);
  srand(98);

  string S; cin >> S;
  int N, K; cin >> N >> K;
  string A; cin >> A;
  if (S == "Flim") {
    for (int i = 1; i <= K; ++i) cout << i << ' ';
  }
  else {
    vector<long double> prop;
    vector<array<int, 2>> nxt(N + 1, {(int)1e9, (int)1e9});
    for (int i = 0; i < N; ++i) {
      if (A[i] - '0') nxt[i][1] = i;
      else nxt[i][0] = i;
    }
    for (int i = N - 1; ~i; --i) {
      umin(nxt[i][1], nxt[i + 1][1]);
      umin(nxt[i][0], nxt[i + 1][0]);
    }
    int last = A[0] - '0';
    cout << 1;
    int j = 1;
    long long same = 2;
    for (int i = 1; i < K; ++i) {
      cout << ' ';
      if (nxt[j][1] == 1e9 || N - nxt[j][1] < K - i - 1) {
        cout << nxt[j][0] + 1;
        j = nxt[j][0] + 1;
        continue;
      }
      if (nxt[j][0] == 1e9 || N - nxt[j][0] < K - i - 1) {
        cout << nxt[j][1] + 1;
        j = nxt[j][1] + 1;
        continue;
      }
      long double s_p = randomFloat(); 
      prop.push_back(s_p);
      if (s_p <= 1 / same) {
        cout << nxt[j][last] + 1;
        j = nxt[j][last] + 1;
        same <<= 1;
      }
      else {
        last = 1 - last;
        cout << nxt[j][last] + 1;
        same = 2;
        j = nxt[j][last] + 1;
      }
    }
    //cerr << endl;
    //for (auto it : prop) cerr << it << ' ';
  }
  return 0;
}