#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
void prt(__int128 x) {
    string s;
    while (x) {
        s += (char)('0' + x % 10);
        x /= 10;
    }
    if (s.empty()) {
        printf("0");
    }
    for (int i = (int)s.size() - 1; i >= 0; i--) {
        printf("%c", s[i]);
    }
}
struct frac {
    __int128 num, den;
    void yuefen() {
        __int128 g = __gcd(num, den);
        num /= g;
        den /= g;
    }
    friend frac operator+ (frac x, frac y) {
        frac res;
        __int128 g = __gcd(x.den, y.den);
        res.den = x.den / g * y.den;
        res.num = res.den / x.den * x.num + res.den / y.den * y.num;
        res.yuefen();
        return res;
    }
    friend frac operator/ (frac x, __int128 val) {
        __int128 g = __gcd(x.num, val);
        x.num /= g;
        x.den *= val / g;
        return x;
    }
};
int n, m, deg[maxn];
vector<int> G[maxn];
frac w[maxn];
int main() {
    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; i++) {
        w[i].den = 1;
    }
    queue<int> q;
    for (int i = 1; i <= n; i++) {
        int d;
        scanf("%d", &d);
        for (int j = 1; j <= d; j++) {
            int a;
            scanf("%d", &a);
            G[i].push_back(a);
            deg[a]++;
        }
    }
    for (int i = 1; i <= m; i++) {
        q.push(i);
        w[i].num = 1;
    }
    while (!q.empty()) {
        int cur = q.front();
        q.pop();
        cout << cur << ' ';
        prt(w[cur].num);
        cout << ' ';
        prt(w[cur].den);
        cout << '\n';
        for (auto i : G[cur]) {
            w[i] = w[i] + (w[cur] / (int)G[cur].size());
            deg[i]--;
            if (deg[i] == 0) {
                q.push(i);
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        if (!(int)G[i].size()) {
            prt(w[i].num);
            printf(" ");
            prt(w[i].den);
            printf("\n");
        }
    }
    return 0;
}