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

int n, m;
int pw[13];
double dp[2][531441][25];

int get(string x) {
	if (x == "rock") return 0;
	else if (x == "paper") return 1;
	else return 2;
}

int main() {
	cin.tie(0);
	cout.tie(0);
	ios::sync_with_stdio(0);

	cin >> n >> m;
	pw[0] = 1;
	for (int i = 1; i <= m; i ++)
		pw[i] = pw[i - 1] * 3;

	for (int i = 1; i <= n; i ++) {
		string out;
		double p;
		cin >> p;
		int mask = 0;
		for (int j = 0; j < m; j ++)
			cin >> out, mask += pw[j] * get(out);
		dp[0][mask][m] += p;
	}

	for (int j = 1; j <= m; j ++)
		for (int i = 0; i < pw[m]; i ++)
			for (int k = 0; k <= 2 * m; k ++) {
				dp[j & 1][i][k] = dp[(j - 1) & 1][i][k]; // 第 j 轮平局
				int out = i / pw[j - 1] % 3;
				// 第 j 轮获胜
				if (k) dp[j & 1][i][k] += dp[(j - 1) & 1][i - out * pw[j - 1] + (out + 2) % 3 * pw[j - 1]][k - 1];
				// 第 j 轮失败
				if (k + 1 < 2 * m) dp[j & 1][i][k] += dp[(j - 1) & 1][i - out * pw[j - 1] + (out + 1) % 3 * pw[j - 1]][k + 1];
			}

	double res = -1;
	int mask;
	for (int i = 0; i < pw[m]; i ++) {
		double sum = 0;
		for (int j = m; j <= 2 * m; j ++)
			sum += dp[m & 1][i][j];
		if (sum > res)
			res = sum, mask = i;
	}

	printf("%.6lf\n", res);
	for (int i = 0; i < m; i ++)
		if (mask / pw[i] % 3 == 0) printf("rock ");
		else if (mask / pw[i] % 3 == 1) printf("paper ");
		else printf("scissors ");
	printf("\n");

	return 0;
}