#include <bits/stdc++.h>

using namespace std;

const int kMaxN = 1e5 + 10;

int f[20], ans[20], c[kMaxN][20], n, m;
double p[kMaxN], maxn = -1;
string s;

void D(int x) {
  if (x > m) {
    double sum = 0;
    for (int i = 1; i <= n; i++) {
      int cnt1 = 0, cnt2 = 0;
      for (int j = 1; j <= m; j++) {
        cnt1 += ((c[i][j] + 1) % 3 == f[j]), cnt2 += ((f[j] + 1) % 3 == c[i][j]);
      }
      (cnt1 >= cnt2) && (sum += p[i]);
    }
    if (sum > maxn) {
      for (int i = 1; i <= m; i++) {
        ans[i] = f[i];
      }
      maxn = sum;
    } else if (sum == maxn) {
      int flag = 0;
      for (int i = 1; i <= m && f[i] <= ans[i]; i++) {
        if (f[i] < ans[i]) {
          flag = 1;
          break;
        }
      }
      if (flag) {
        for (int i = 1; i <= m; i++) {
          ans[i] = f[i];
        }
      }
    }
    return;
  }
  for (int i = 0; i < 3; i++) {
    f[x] = i, D(x + 1);
  }
}

signed main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> p[i];
    for (int j = 1; j <= m; j++) {
      cin >> s, c[i][j] = (s != "rock") + (s == "scissors");
    }
  }
  D(1);
  cout << fixed << setprecision(6) << maxn << '\n';
  for (int i = 1; i <= m; i++) {
    cout << (!ans[i] ? "rock " : (ans[i] < 2 ? "paper " : "scissors "));
  }
  return cout << '\n', 0;
}