#include <set>
#include <cmath>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MAXN 1024
#define EPS 1e-9
#define vint vector<int>
#define MOD
#define LL long long
using namespace std;

int n,m;//n company m person

double dir_cp[MAXN][MAXN],cp[MAXN][MAXN];
double dir_cc[MAXN][MAXN],cc[MAXN][MAXN];
vint son[MAXN],sonp[MAXN];
double f[MAXN][11][11];
int dfn[MAXN],vis[MAXN],low[MAXN],num,stk[MAXN],cnt,SCC,belong[MAXN];
vint scc[MAXN];
set<int> scc_son[MAXN],scc_sonp[MAXN];
bool instk[MAXN];
int id_in[MAXN];

void Tarjan(int x){
    dfn[x]=low[x]=++num;
    stk[++cnt]=x;
    instk[x]=vis[x]=1;
    for(auto &v:son[x]){
        if(!vis[v]){
            Tarjan(v);
            low[x]=min(low[x],low[v]);
        }
        else if(instk[v])
            low[x]=min(low[x],dfn[v]);
    }
    if(dfn[x]==low[x]){
        int t;
        SCC++;
        do{
            t=stk[cnt--];
            instk[t]=0;
            belong[t]=SCC;
            scc[SCC].push_back(t);
        }while(t!=x);
    }
}

struct Token{
    int is_company;
    int id;
    double val;
    void input(){
        char s[30];
        scanf("%s",s);
        if(s[0]=='P')is_company=0;
        else is_company=1;
        id=0;val=0;
        int i=1;
        for(i=1;'0'<=s[i] && s[i]<='9';i++)
            id=id*10+s[i]-'0';
        for(i=i+1;'0'<=s[i] && s[i]<='9';i++)
            val=val*10+s[i]-'0';
        val+=(s[++i]-'0')*0.1;
        val=val/100;
    }
};

void input(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        int x;
        Token y;
        scanf("%d",&x);
        for(int j=1;j<=x;j++){
            y.input();
            if(y.is_company){
                dir_cc[i][y.id]=y.val;
                son[i].push_back(y.id);
            }
            else{
                dir_cp[i][y.id]=y.val;
                sonp[i].push_back(y.id);
            }
        }
    }
}

inline void Guass(double p[][11],vint &vec,double dir[][MAXN],int aim,double ans[][MAXN]){
    double a[12][12];
    int n=vec.size();
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)
            a[i][j]=-p[i][j];
        a[i][i]+=1;
        a[i][n+1]=dir[vec[i-1]][aim];
    }
    int Rank=0;
    for(int c=1;c<=n;c++){
        int loc=0;
        for(int i=Rank+1;i<=n;i++){
            if(abs(a[i][c])>EPS){
                loc=i;break;
            }
        }
        if(!loc)continue;
        Rank++;
        for(int i=1;i<=n+1;i++)
            swap(a[Rank][i],a[loc][i]);
        for(int r=1;r<=n;r++){
            if(r==Rank)continue;
            double tmp=-a[r][c]/a[Rank][c];
            for(int k=c;k<=n+1;k++)
                a[r][k]+=a[Rank][k]*tmp;
        }
    }
    for(int c=1,r=0;c<=n;c++){
        if(abs(a[r+1][c])>EPS){
            r++;
            ans[vec[c-1]][aim]=a[r][n+1]/a[r][c];
        }
        else
            ans[vec[c-1]][aim]=0;
    }
}

void dfs(int x){
    vis[x]=1;
    for(auto &v:scc_son[belong[x]]){
        if(!vis[v])dfs(v);
        for(int j=1;j<=m;j++){
            cp[x][j]+=cp[v][j]*cc[x][v];
        }
    }
}

int main(){

    input();

    for(int i=1;i<=n;i++)
        if(!vis[i])
            Tarjan(i);

    for(int i=1;i<=SCC;i++){
        int x=0;
        for(auto &u:scc[i])
            id_in[u]=++x;
        for(auto &u:scc[i]){
            for(auto &v:son[u]){
                if(belong[v]!=belong[u]){
                    scc_son[i].insert(v);
                }
                else{
                    f[i][id_in[u]][id_in[v]]=dir_cc[u][v];
                }
            }
            for(auto &v:sonp[u]){
                scc_sonp[i].insert(v);
            }
        }
        for(auto &v:scc_son[i]){
            Guass(f[i],scc[i],dir_cc,v,cc);
        }
        for(auto &v:scc_sonp[i]){
            Guass(f[i],scc[i],dir_cp,v,cp);
        }
    }
    memset(vis,0,sizeof(vis));

    for(int i=1;i<=n;i++)
        if(!vis[i])
            dfs(i);

    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            printf("%.7lf%c",cp[i][j],j==m?'\n':' ');
        }
    }

    return 0;
}