#include <iostream>
#include <cstdio>

using namespace std;

const int N = 1e5 + 5, M = 5e5 + 5;

typedef __int128 LL;

int n, m, q[N], d[N], hh, tt = -1, out[N];

bool vis[N];

LL P[N], Q[N];

LL gcd(LL a, LL b) {
	return b ? gcd(b, a % b) : a;
}

int head[N], numE = 0;

struct E{
	int next, v;
} e[M];

void inline add(int u, int v) {
	e[++numE] = (E) { head[u], v };
	head[u] = numE;
}

void print(LL x) {
	if (x > 9) print(x / 10);
	putchar((x % 10) + '0'); 
}

int main() {
	// freopen("water.in", "r", stdin);
	// freopen("water.out", "w", stdout);
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) {
		int t; scanf("%d", &t);
		out[i] = t;
		while (t--) {
			int x; scanf("%d", &x);
			add(i, x);
			d[x]++;
		}
		if (!out[i]) vis[i] = true;
		Q[i] = 1;
	}
	for (int i = 1; i <= n; i++)
		if (!d[i]) q[++tt] = i;
	while (hh <= tt) {
		int u = q[hh++];
		if (u <= m) {
			P[u] += Q[u];
		}
		LL dd = gcd(P[u], Q[u]);
		P[u] /= dd, Q[u] /= dd;
		LL a = Q[u] * out[u];
		for (int i = head[u]; i; i = e[i].next) {
			int v = e[i].v;
			LL b = Q[v] / gcd(a, Q[v]) * a;
			P[v] *= b / Q[v];
			P[v] += P[u] * (b / a);
			Q[v] = b;
			if (--d[v] == 0) q[++tt] = v;
		}
	}
	for (int i = 1; i <= n; i++)
		if (vis[i]) {
			print(P[i]); putchar(' ');
			print(Q[i]);
			puts("");
		}
}