#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define int __int128
#define rep(i, a, b) for (int i = (a); i <= (b); i ++ )
#define rop(i, a, b) for (int i = (a); i < (b); i ++ )
#define dep(i, a, b) for (int i = (a); i >= (b); i -- )
#define dop(i, a, b) for (int i = (a); i > (b); i -- )

#define Darr(a, L, R) (cerr << #a "[" << L << " ~ " << R << "] = "; rep(x, L, R) cerr << a[x] << " "; cerr << '\n';)
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define D(x) (cerr << #x << " = " << x << '\n')
#define vit vector<int>::iterator
#define all(x) x.begin(), x.end()
#define min(a, b) (a < b ? a : b)
#define max(a, b) (a > b ? a : b)
#define chkmin(a, b) (a = min(a, b))
#define chkmax(a, b) (a = max(a, b))
#define sit set<int>::iterator
#define lowbit(x) (x & -x)
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pi acos(-1)
#define gc getchar
#define pc putchar
#define db double
#define y second
#define x first

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<db, db> PDD;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
const int mod = 998244353;
const int eps = 1e-9;

const int N = 1000010; int T = 1;
void print(int x) { dep(i, 20, 0) pc(((x >> i) & 1) ? '1' : '0'); }
int qpow(int a, int b = mod - 2, int s = 1) { for (; b; b >>= 1, a = 1ll * a * a % mod) if (b & 1) s = 1ll * s * a % mod; return s; }
namespace IO {
	void read() { return; }
	void write(char ch) { pc(ch); return; }
	void write() { return; }
	template <typename T> void read(T &x) { x = 0; T w = 0; char ch = gc(); while (ch < '0' || ch > '9') w |= (ch == '-'), ch = gc(); while ('0' <= ch && ch <= '9') x = x * 10 + (ch ^ 48), ch = gc(); x = w ? -x : x; }
	template <typename T> void print(T x) { if (!x) return; print<T>(x / 10), pc((x % 10) ^ '0'); }
	template <typename T> void write(T x) { if (x > 0) print<T>(x); else if (x < 0) pc('-'), print<T>(-x); else pc('0'); }
	template <typename T> void write(T x, char en) { write<T>(x), pc(en); }
	template <typename T, typename ...T2> void read(T &s, T2 &...oth) { read(s); read(oth...); return; }
}; using namespace IO;

int gcd(int a, int b) { return !b ? a : gcd(b, a % b); }
struct Frac {
	int s, t;
	void R() {
		if (t == 0) s = 0;
		else if (s == 0) t = 1;
		else { int d = gcd(s, t); s /= d, t /= d; }
	}
	Frac() { s = 0, t = 1; }
	Frac(int a, int b) { s = a, t = b; R(); }
	Frac operator + (const Frac &p)const { return Frac(s * p.t + p.s * t, t * p.t); }
	Frac operator - (const Frac &p)const { return Frac(s * p.t - p.s * t, t * p.t); }
	Frac operator * (const Frac &p)const { return Frac(s * p.s, t * p.t); }
	Frac operator / (const Frac &p)const { return Frac(s * p.t, t * p.s); }
	Frac operator * (const int &p)const { return Frac(s * p, t); }
	Frac operator / (const int &p)const { return Frac(s, t * p); }
}f[N];
int n, m, d[N], dt[N];
vector<int> E[N];
void sub() {
	read(n, m);
	vector<int> outer;
	rep(i, 1, n) {
		int t; read(t);
		if (!t) outer.pb(i);
		while (t -- ) {
			int v; read(v);
			E[i].pb(v); d[v] ++ ;
		}
	} rep(i, 1, n) dt[i] = d[i];
	queue<int> q;
	rep(i, 1, n) if (!d[i]) q.push(i), f[i] = Frac(1, 1);
	while (q.size()) {
		auto t = q.front(); q.pop();
		for (auto v : E[t]) {
			f[v] = f[v] + f[t] / (int)E[t].size();
			d[v] -- ; if (!d[v]) q.push(v);
		}
	} for (auto i : outer)
		write(f[i].s, ' '), write(f[i].t, '\n');
}
signed main() {
//	read(T);
	while (T -- ) sub();
	return 0;
}