#include <bits/stdc++.h>
using namespace std;

void main_program();

signed main(){
	// ios_base::sync_with_stdio(0); cin.tie(0);
	main_program();
}

mt19937_64 rng(12345);
int n, k;
string player, s;

const int BLOCKSIZE = 2;
const vector<string> allstr = {"00", "01", "10", "11"};

int solve_player1(string S){
	vector<int> winning(BLOCKSIZE, 0);
	for (auto T: allstr){
		for (int choice = 0; choice < BLOCKSIZE; choice++){
			for (int opp = 0; opp < BLOCKSIZE; opp++){
				winning[choice] += (T[choice] == S[opp]);
			}
		}
	}
	int mx = *max_element(winning.begin(), winning.end());
	for (int i = 0; i < BLOCKSIZE; i++){
		if (winning[i] == mx) return i;
	}
	return 0;
}

int solve_player2(string S){
	vector<int> winning(BLOCKSIZE, 0);
	for (auto T: allstr){
		int opp = solve_player1(T);
		for (int choice = 0; choice < BLOCKSIZE; choice++){
			if (T[choice] == S[opp]) winning[choice]++;
		}
	}
	int mx = *max_element(winning.begin(), winning.end());
	for (int i = 0; i < BLOCKSIZE; i++){
		if (winning[i] == mx) return i;
	}
	return 0;
}

void main_program(){
	cin >> player >> n >> k >> s;

	vector<int> blocks;
	for (int i = 0; i < n; i += BLOCKSIZE){
		blocks.push_back(i);
	}
	shuffle(blocks.begin(), blocks.end(), rng);
	blocks.resize(k);
	sort(blocks.begin(), blocks.end());

	vector<int> lst;

	for (auto i: blocks){
		if (player == "Flim") lst.push_back(i + solve_player1(s.substr(i, BLOCKSIZE)));
		else lst.push_back(i + solve_player2(s.substr(i, BLOCKSIZE)));
	}

	for (int i = 0; i < k; i++){
		cout << lst[i] + 1 << " \n"[i == k-1];
	}
}