#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,y,x) for (int i=(y);i>=(x);i--)
#define pii pair<int,int>
#define fir first
#define sec second
#define MP make_pair
#define templ template<typename T>
templ bool chkmin(T &x,T y){return x>y?x=y,1:0;}
templ bool chkmax(T &x,T y){return x<y?x=y,1:0;}
void file() {
    #ifdef zqj
    freopen("a.in","r",stdin);
    #endif
}
typedef long long ll;
typedef double db;
#define sz 2333

int MS;
struct Mat {
    db a[22][22];
    Mat(){memset(a,0,sizeof(a));}
    Mat operator * (const Mat &m) const {
        Mat res;
        rep(k,1,MS) rep(i,1,MS) rep(j,1,MS) res.a[i][j]+=a[i][k]*m.a[k][j];
        return res;
    }
};

int n,m;
vector<pair<int,db>>V[sz];

int bel[sz],dfn[sz],low[sz],cc,T;
stack<int>st; int in[sz];
vector<int>ww[sz];
int id[sz];
void dfs(int x) {
    dfn[x]=low[x]=++cc;
    st.push(x); in[x]=1;
    for (auto [v,_]:V[x]) if (v>0) {
        if (!dfn[v]) dfs(v),chkmin(low[x],low[v]);
        else if (in[v]) chkmin(low[x],dfn[v]);
    }
    if (low[x]==dfn[x]) {
        ++T; int y;
        do y=st.top(),st.pop(),bel[y]=T,in[y]=0,ww[T].push_back(y),id[y]=ww[T].size(); while (y!=x);
    }
}

vector<pair<int,db>>V2[sz];

void work(vector<int>ww) {
    Mat M;
    int m=ww.size();
    MS=m*2;
    for (auto x:ww) {
        for (auto [v,w]:V[x]) {
            if (v<0||bel[v]!=bel[x]) M.a[id[x]][id[x]+m]+=w;
            else M.a[id[x]][id[v]]+=w;
        }
        M.a[id[x]+m][id[x]+m]=1;
    }
    rep(i,1,100) M=M*M;
    for (auto x:ww) for (auto v:ww) if (M.a[id[x]][id[v]+m]>1e-9) {
        db sum=0;
        for (auto [vv,w]:V[v]) if (vv<0||bel[vv]!=bel[x]) sum+=w;
        for (auto [vv,w]:V[v]) if (vv<0||bel[vv]!=bel[x]) V2[x].push_back({vv,M.a[id[x]][id[v]+m]*w/sum});
    }
}

int main() {
    file();
    ios::sync_with_stdio(false),cin.tie(0);
    cin>>n>>m;
    rep(i,1,n) {
        int K,x; db w; cin>>K;
        while (K--) {
            char c,_;
            cin>>c;
            cin>>x;
            cin>>_;
            cin>>w;
            w/=100;
            if (c=='P') V[i].push_back({-x,w});
            else V[i].push_back({x,w});
        }
    }
    rep(i,1,n) if (!dfn[i]) dfs(i);
    rep(i,1,T) work(ww[i]);
    static int ii[sz];
    rep(i,1,n) ii[i]=i;
    sort(ii+1,ii+n+1,[](int x,int y){return bel[x]>bel[y];});
    rep(i,1,n) {
        static db dp[sz],ans[sz];
        rep(j,1,max(n,m)) dp[j]=ans[j]=0;
        dp[i]=1;
        rep(_,1,n) {
            int x=ii[_];
            for (auto [v,w]:V2[x])
                if (v<0) ans[-v]+=w*dp[x];
                else dp[v]+=w*dp[x];
        }
        rep(j,1,m) printf("%.5lf%c",ans[j]," \n"[j==m]); 
    }
    return 0;
}