#include <bits/stdc++.h>
#define deb cout << "in " << __LINE__ << "\t: "
using namespace std;
const string str = "rps";
string out[3] = {"rock", "paper", "scissors"};
#define int long long
struct node {
	int p[3];
	node() {}
	node(int x, int y, int z) {p[0] = x, p[1] = y, p[2] = z;}
};
node operator * (node a, node b) {
	node res{0, 0, 0};
	for (int i = 0; i < 3; i++)
		for (int j = 0; j < 3; j++)
			res.p[(i + j) % 3] += a.p[i] * b.p[j];
	res.p[1] -= res.p[2], res.p[0] -= res.p[2], res.p[2] = 0;
	return res;
}
node operator + (node a, node b) {
	for (int i = 0; i < 3; i++)
		a.p[i] += b.p[i];
	a.p[1] -= a.p[2], a.p[0] -= a.p[2], a.p[2] = 0;
	return a;
}
int n, m, pw[13];
node a[550000], b[550000], w1, w2;
void fwt(node *f) {
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < pw[m]; j++) {
			if (j / pw[i] % 3) continue;
			node x = a[j], y = a[j + pw[i]], z = a[j + pw[i] * 2];
			a[j] = x + y + z;
			a[j + pw[i]] = x + y * w1 + z * w2;
			a[j + pw[i] * 2] = x + y * w2 + z * w1;
		}
	}
}
void ifwt(node *f) {
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < pw[m]; j++) {
			if (j / pw[i] % 3) continue;
			node x = a[j], y = a[j + pw[i]], z = a[j + pw[i] * 2];
			a[j] = x + y + z;
			a[j + pw[i]] = x + y * w2 + z * w1;
			a[j + pw[i] * 2] = x + y * w1 + z * w2;
		}
		for (int j = 0; j < pw[m]; j++)
			for (int k = 0; k < 3; k++)
				a[j].p[k] /= 3;
	}
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n >> m, w1 = {0, 1, 0}, w2 = {0, 0, 1};
	w2.p[1] -= w2.p[2], w2.p[0] -= w2.p[2], w2.p[2] = 0;
	pw[0] = 1;
	for (int i = 1; i <= 12; i++)
		pw[i] = pw[i - 1] * 3;
	for (int i = 1; i <= n; i++) {
		double p;
		cin >> p;
		int val = p * 1000000 + 0.5, ind = 0;
		for (int j = 1; j <= m; j++) {
			string s;
			cin >> s;
			ind += pw[m - j] * str.find(s[0]);
		}
		a[ind].p[0] += val;
	}
	for (int i = 0; i < pw[m]; i++) {
		int sum = 0;
		for (int j = 0; j < m; j++) {
			if (i / pw[j] % 3 == 1) sum++;
			else if (i / pw[j] % 3 == 2) sum--;
		}
		if (sum >= 0) b[i].p[0] = 1;
	}
	fwt(a), fwt(b);
	for (int i = 0; i < pw[m]; i++)
		a[i] = a[i] * b[i];
	ifwt(a);
	int mx = 0;
	for (int i = 0; i < pw[m]; i++) {
		a[i].p[0] -= a[i].p[1];
		mx = max(mx, a[i].p[0]);
	}
	cout << fixed << setprecision(6) << (mx+ 0.5) / 1000000.0 << "\n";
	for (int i = 0; i < pw[m]; i++)
		if (a[i].p[0] == mx) {
			for (int j = m - 1; j >= 0; j--)
				cout << out[i / pw[j] % 3] << " ";
			cout << "\n";
			break;
		}
	return 0;
}