#include <cstdio>
#include <queue>
#include <vector>
#include <algorithm>
#define ll __int128
#define pb push_back
#define N 100005
using std::queue;
using std::vector;
int n, m, deg[N], id[N], top;
ll a[N], b[N];
vector<int> e[N];
inline ll gcd(ll a, ll b) {
    while (b)
        a %= b, std::swap(a, b);

    return a;
}
queue<int> q;
inline void gtps(void) {
    for (int i = 1; i <= n; ++i)
        if (!deg[i])
            q.push(i);

    while (!q.empty()) {
        int u = q.front();
        q.pop();
        id[++top] = u;

        for (int i = 0; i < e[u].size(); ++i) {
            int v = e[u][i];
            ll ta = a[u], tb = b[u] * e[u].size();
            a[v] = a[v] * tb + ta * b[v], b[v] *= tb;
            ll d = gcd(a[v], b[v]);
            b[v] /= d, a[v] /= d;
            --deg[v];

            if (!deg[v])
                q.push(v);
        }
    }
}
inline void prt(ll x) {
    if (x / 1000000000)
        printf("%lld", (long long)(x / 1000000000));

    printf((x / 1000000000 ? "%09lld" : "%lld"), (long long)(x % 1000000000));
}
int main() {
    scanf("%d%d", &n, &m);

    for (int i = 1, d; i <= n; ++i) {
        b[i] = 1;
        scanf("%d", &d);

        for (int j = 1, x; j <= d; ++j)
            scanf("%d", &x), ++deg[x], e[i].pb(x);
    }

    for (int i = 1; i <= m; ++i)
        a[i] = 1;

    gtps();

    for (int i = 1; i <= n; ++i)
        if (!e[i].size())
            prt(a[i]), putchar(' '), prt(b[i]), putchar('\n');

    return 0;
}