/*
 * Title: P7113 [NOIP2020] 排水系统
 * Source: 洛谷
 * URL: https://www.luogu.com.cn/problem/P7113
 * Author: Steven_lzx
 * Command: -std=c++23 -O2 -Wall -fno-ms-extensions
 * Date: 2022.11.21
 */
#include <bits/stdc++.h>
using namespace std;
#define int __int128
int n, m;
struct Frac
{
    int p, q;
    Frac()
    {
        p = 0;
        q = 0;
        return;
    }
    Frac(int _p, int _q)
    {
        p = _p;
        q = _q;
    }
    Frac operator+(Frac b)
    {
        int ga, gb;
        Frac res;
        if (!q)
            return b;
        gb = q * b.q / __gcd(q, b.q);
        res.p = (b.p * (gb / b.q) + p * (gb / q));
        res.q = gb;
        ga = __gcd(res.p, res.q);
        res.p /= ga;
        res.q /= ga;
        return res;
    }
};
vector<Frac> a, ans;
vector<vector<int>> g;
int read()
{
    int res = 0;
    char ch = getchar();
    bool f = false;
    while (!isdigit(ch))
    {
        if (ch == '-')
            f = true;
        ch = getchar();
    }
    while (isdigit(ch))
    {
        res = (res << 3) + (res << 1) + (ch ^ 48);
        ch = getchar();
    }
    if (f)
        res = ~(res - 1);
    return res;
}
void write(int x)
{
    int top = 0;
    char st[45];
    do
    {
        st[++top] = x % 10 + '0';
        x /= 10;
    } while (x);
    while (top)
        putchar(st[top--]);
    return;
}
void DFS(int u)
{
    Frac temp;
    if (g[u].empty())
    {
        ans[u] = ans[u] + a[u];
        a[u].p = 0;
        a[u].q = 1;
        return;
    }
    temp = a[u];
    temp.q *= g[u].size();
    for (auto v : g[u])
    {
        a[v] = a[v] + temp;
        DFS(v);
    }
    a[u] = Frac(0, 0);
    return;
}
signed main()
{
    int u, v;
    n = read();
    m = read();
    a.resize(n + 5);
    ans.resize(n + 5);
    g.resize(n + 5);
    for (int i = 1; i <= n; i++)
    {
        u = read();
        for (int j = 1; j <= u; j++)
        {
            v = read();
            g[i].push_back(v);
        }
    }
    for (int i = 1; i <= m; i++)
    {
        for (int j = 1; j <= n; j++)
            a[j] = Frac(0, 0);
        a[i].p = a[i].q = 1;
        DFS(i);
    }
    for (int i = 1; i <= n; i++)
    {
        if (g[i].empty())
        {
            write(ans[i].p);
            putchar(' ');
            write(ans[i].q);
            putchar('\n');
        }
    }
    return 0;
}