#pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")
#include <bits/stdc++.h>

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef double ld;

template<typename T>
inline bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
inline bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef LOCAL
#define D for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl
template <class ...Ts> auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }
#else
#define D while (false)
#define LOG(...)
#endif // LOCAL

const int max_n = -1, inf = 1000111222;
const ll linf = inf * 1ll * inf;


const ld eps = 1e-7;

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;
    vector <vector <pair<pii, ld> > > have(n);
    char c, something;
    for (int i = 0, k; i < n; i++) {
        cin >> k;
        ld p;
        for (int j = 0, id; j < k; j++) {
            cin >> c >> id >> something >> p;
            p /= 100.0;
            --id;
            have[i].pb({{c == 'P', id}, p});
        }
    }
    cout << fixed;
    cout.precision(5);
    vector <vector <ld> > a(n + m, vector <ld> (n + m));
    vector <vector <ld> > b(n + m, vector <ld> (n + m));
    for (int i = 0; i < n; i++) {
        for (auto &j : have[i]) {
            if (j.first.first) {
                a[i][n + j.first.second] = j.second;
            }
            else {
                a[i][j.first.second] = j.second;
            }
        }
    }
    for (int i = 0; i < m; i++) {
        a[n + i][n + i] = 1;
    }
    for (int it = 0; it < 15; it++) {
        for (int i = 0; i < n + m; i++) {
            for (int j = 0; j < n + m; j++) {
                b[i][j] = 0;
            }
        }
        vector <vector <int> > need(n + m);
        for (int i = 0; i < n + m; i++) {
            for (int j = 0; j < n + m; j++) {
                if (abs(a[i][j]) < eps) {
                    continue;
                }
                need[i].pb(j);
            }
        }
        for (int i = 0; i < n + m; i++) {
            for (int j = 0; j < n + m; j++) {
                if (abs(a[i][j]) < eps) continue;
                for (int &k : need[j]) {
                    b[i][k] += a[i][j] * a[j][k];
                }
            }
        }
        a.swap(b);
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cout << a[i][n + j] << ' ';
        }
        cout << '\n';
    }
}