#include <bits/stdc++.h>
using namespace std;
constexpr int N = 1e3 + 5;
constexpr int M = 10 + 5;

struct edge {
  int type, to;
  double v;
  void read() {
    char c;
    cin >> c, type = c == 'C';
    cin >> to;
    cin >> c >> v, v /= 100;
  }
};
vector<edge> e[N];
int c, p, sz, ind[N], pos[N];
int dn, dfn[N], low[N], vis[N], stc[N], top;
double f[N][N], A[M][M];
void tarjan(int id) {
  dfn[id] = low[id] = ++dn, vis[id] = 1, stc[++top] = id;
  for(edge _ : e[id]) {
    if(!_.type) continue;
    int it = _.to;
    if(!dfn[it]) tarjan(it), low[id] = min(low[id], low[it]);
    else if(vis[it]) low[id] = min(low[id], dfn[it]);
  }
  if(low[id] == dfn[id]) {
    sz = 0;
    memset(pos, 0, sizeof(pos));
    for(int x = 0; x != id; ) {
      ind[++sz] = x = stc[top--], pos[x] = sz;
      vis[x] = 0;
    }
    assert(sz <= 10);
    for(int i = 1; i <= p; i++) {
      memset(A, 0, sizeof(A));
      for(int j = 1; j <= sz; j++) A[j][j] = 1;
      for(int j = 1; j <= sz; j++) {
        int id = ind[j];
        for(edge _ : e[id]) {
          if(_.type == 1) {
            if(pos[_.to]) A[j][pos[_.to]] += -_.v;
            else A[j][sz + 1] += f[_.to][i] * _.v;
          }
          else if(_.to == i) A[j][sz + 1] += _.v;
        }
      }
      for(int r = 1; r <= sz; r++) {
        int p = r;
        for(int i = r + 1; i <= sz; i++) {
          if(fabs(A[i][r]) > fabs(A[p][r])) p = i;
        }
        swap(A[r], A[p]);
        assert(fabs(A[r][r]) > 1e-9);
        for(int j = sz + 1; j >= r; j--) A[r][j] /= A[r][r];
        for(int i = 1; i <= sz; i++) {
          if(i == r) continue;
          for(int j = sz + 1; j >= r; j--) A[i][j] -= A[r][j] * A[i][r];
        }
      }
      for(int r = 1; r <= sz; r++) f[ind[r]][i] = A[r][sz + 1];
    }
  }
}

int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  #ifdef ALEX_WEI
    FILE* IN = freopen("1.in", "r", stdin);
    FILE* OUT = freopen("1.out", "w", stdout);
  #endif
  cin >> c >> p;
  for(int i = 1; i <= c; i++) {
    int k;
    cin >> k;
    while(k--) {
      edge x;
      x.read();
      e[i].push_back(x);
    }
  }
  for(int i = 1; i <= c; i++) if(!dfn[i]) tarjan(i);
  for(int i = 1; i <= c; i++)
    for(int j = 1; j <= p; j++) {
      printf("%.9lf%c", f[i][j], j == p ? '\n' : ' ');
    }
  cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
  return 0;
}
/*
g++ I.cpp -o I -std=c++14 -O2 -DALEX_WEI
*/