/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define pb push_back
#define ff first
#define ss second
#define isz(x) (int)x.size()
using namespace std;

const int mxN = 2e5 + 5;
const int mod = 1e9 + 7;
const i64 oo = 1e18;

vector<int> chosen = {2, 2, 1, 2, 0, 0, 1, 2, 2, 2, 1, 2, 0, 0, 1, 2};
// pair<int, vector<int>> best;
// int cnt[3][2];

// void check() {
//     int sum = 0;
//     for (int i = 0; i < 8; ++i) {
//         for (int j = 8; j < 16; ++j) {
//             sum += (j >> chosen[i] & 1) == (i >> chosen[j] & 1);
//         }
//     }
//     best = max(best, {sum, chosen});
// }

// void back(int dep) {
//     if (dep == 16) {
//         check();
//         return;
//     }
//     for (int i = 0; i < 3; ++i) {
//         chosen[dep] = i;
//         back(dep + 1);
//     }
// }

string name, s;
int n, k;

void solve() {
    // chosen.resize(16); back(0);
    // cout << best.ff << endl;
    // for (int val : best.ss) cout << val << ", ";
    cin >> name >> n >> k >> s;
    for (int i = 0; i < k; ++i) {
        int val = 0;
        for (int j = i * 10 + 2; j >= i * 10; --j) val = val * 2 + (s[j] - '0');
        if (name == "Flim") cout << i * 10 + chosen[val] + 1 << " ";
        if (name == "Flam") cout << i * 10 + chosen[val + 8] + 1 << " ";
    }
}

signed main() {

#ifndef CDuongg
    if(fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
   auto end = chrono::high_resolution_clock::now();
   cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
   cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
   cout << "Check array size pls sir" << endl;
#endif

}