#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const int N = 600005;
const int INF = 0x3f3f3f3f;
int pw[13];
double f[2][N][25];
int get(string x) {
    if (x == "rock") return 0;
    if (x == "paper") return 1;
    return 2;
}
int main() {
    int n, m;
    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++) {
        double p;
        cin >> p;
        int k = 0;
        for (int j = 0; j < m; j++) {
            string s;
            cin >> s;
            k += pw[j] * get(s);
        }
        f[0][k][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++) {
                f[j & 1][i][k] = f[(j - 1) & 1][i][k];
                int t = i / pw[j - 1] % 3;
                if (k) f[j & 1][i][k] += f[(j - 1) & 1][i - t * pw[j - 1] + (t + 2) % 3 * pw[j - 1]][k - 1];
                if (k + 1 < 2 * m) f[j & 1][i][k] += f[(j - 1) & 1][i - t * pw[j - 1] + (t + 1) % 3 * pw[j - 1]][k + 1];
            }
        }
    }
    double res = -1;
    int k;
    vector<pair<string, int>> vec;
    for (int i = 0; i < pw[m]; i++) {
        string s;
        for (int j = 0; j < m; j++) {
            s += (i / pw[j] % 3) + '0';
        }
        vec.push_back({s, i});
    }
    sort(vec.begin(), vec.end());
    for (auto [t, i] : vec) {
        double sum = 0;
        for (int j = m; j <= 2 * m; j++) sum += f[m & 1][i][j];
        if (sum > res + 1e-9) {
            res = sum;
            k = i;
        }
    }
    printf("%.6lf\n", res);
    for (int i = 0; i < m; i++) {
        if (k / pw[i] % 3 == 0) {
            printf("rock ");
        } else if (k / pw[i] % 3 == 1) {
            printf("paper ");
        } else {
            printf("scissors ");
        }
    }
    printf("\n");
    return 0;
}