# include <bits/stdc++.h>
using namespace std;
clock_t C;
const int MAXN = 1e5 + 10, MAXM = 6600;
int n, m, a[MAXN];
double f[MAXN];
int b[13], ans[13];
double mx = 0;
int pw[13], c[MAXM][MAXM];
double cnt[730][20];
int getv(int x, int y) {
	return (x / pw[y]) % 3;
}
void init() {
	pw[0] = 1;
	for (int i = 1; i <= 12; i++) {
		pw[i] = pw[i - 1] * 3;
	}
	for (int i = 0; i < pw[4]; i++) {
		for (int j = 0; j < pw[4]; j++) {
			for (int k = 0; k < 4; k++) {
				int tmp = getv(i, k) - getv(j, k);
				if (tmp == 1 || tmp == -2) c[i][j]++;
				if (tmp == -1 || tmp == 2) c[i][j]--;
			}
		}
	}
	for (int i = 0; i < pw[8]; i++) {
		for (int j = 0; j < pw[8]; j++) {
			c[i][j] = c[i / pw[4]][j / pw[4]] + c[i % pw[4]][j % pw[4]];
		}
	}
}
void dfs2(int id) {
	if (id > 12) {
		int res = 0;
		for (int i = 7; i <= 12; i++) {
			res += pw[i - 7] * b[i];
		}
		double sum = 0;
		for (int i = 0; i < pw[6]; i++) {
			int tmp = c[res][i];
			sum += cnt[i][6 - tmp];
		}
		// for (int i = 1; i <= m; i++) cout << b[i] << " " ;
		// cout << sum << endl ;
		if (sum > mx) {
			mx = sum;
			for (int i = 1; i <= 12; i++) ans[i] = b[i];
		}
		return ;
	}
	if (id > m) {
		b[id] = 0;
		dfs2(id + 1);
		return ;
	}
	for (int i = 0; i < 3; i++) {
		b[id] = i;
		dfs2(id + 1);
	}
}
void dfs(int id) {
	if (1.0 * (clock() - C) / CLOCKS_PER_SEC > 0.95) {

	printf("%.6lf\n", mx);
	for (int i = 1; i <= m; i++) {
		if (ans[i] == 0) cout << "rock ";
		else if (ans[i] == 1) cout << "paper " ;
		else cout << "scissors " ;
	}
	cout << endl ;
	exit(0);
	}
	if (id > 6) {
		for (int i = 0; i < pw[6]; i++) {
			for (int j = 0; j <= 12; j++) cnt[i][j] = 0;
		}
		int res = 0;
		for (int i = 1; i <= 6; i++) {
			res = res + pw[i - 1] * b[i];
		}
		for (int i = 1; i <= n; i++) {
			cnt[a[i] / pw[6]][c[res][a[i] % pw[6]] + 6] += f[i]; 
		}
		for (int i = 0; i < pw[6]; i++) {
			for (int j = 11; j >= 0; j--) {
				cnt[i][j] += cnt[i][j + 1];
			}
		}
		// cout << cnt[0][6] << endl ;
		// exit(0);
		dfs2(7);
		return ;
	}
	if (id > m) {
		b[id] = 0;
		dfs(id + 1);
		return ;
	}
	for (int i = 0; i < 3; i++) {
		b[id] = i;
		dfs(id + 1);
	}
}

signed main() {
	C = clock();
	init();
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> f[i];
		for (int j = 1; j <= m; j++) {
			int t;
			string s;
			cin >> s;
			if (s[0] == 'r') t = 0;
			else if (s[0] == 'p') t = 1;
			else t = 2;
			a[i] += pw[j - 1] * t;
		}
	}
	// cout << c[0][15] << " " << c[0][18] << endl ;
	dfs(1);
	printf("%.6lf\n", mx);
	for (int i = 1; i <= m; i++) {
		if (ans[i] == 0) cout << "rock ";
		else if (ans[i] == 1) cout << "paper " ;
		else cout << "scissors " ;
	}
	cout << endl ;
	return 0;
}