# include <bits/stdc++.h>
# define ll long long
# define fi first
# define se second
# define pii pair<int, int>
using namespace std;

vector<int> edge[100001];
int in[100001];
pair<ll, ll> val[100001];

void ad(pair<ll, ll> &a, pair<ll, ll> b) {
	ll c = a.fi * b.se + a.se * b.fi;
	ll d = a.se * b.se;
	
	if(c == 0) {
		a = {0, 1};
		return;
	}
	
	ll e = __gcd(c, d);
	c /= e;
	d /= e;
	a = {c, d};
	return;
}

int main() {
	int N, M;
	scanf("%d %d", &N, &M);
	for(int i=1;i<=N;i++) {
		val[i] = {0, 1};
		int K;
		scanf("%d", &K);
		while(K--) {
			int x;
			scanf("%d", &x);
			edge[i].push_back(x);
			in[x]++;
		}
	}
	
	val[M] = {1, 1};
	
	vector<int> nw;
	nw.clear();
	
	for(int i=1;i<=N;i++) {
		if(!in[i]) {
			nw.push_back(i);
		}
	}
	
	while(nw.size()) {
		int v = nw.back();
		nw.pop_back();
		
		if(edge[v].size() == 0) continue;
		
		val[v].se *= (edge[v].size());
		
		if(val[v].fi != 0) {
			ll e = __gcd(val[v].fi, val[v].se);
			val[v].fi /= e;
			val[v].se /= e;
		}
		
		
		for(auto p : edge[v]) {
			in[p]--;
			ad(val[p], val[v]);
			if(!in[p]) nw.push_back(p);
		}
	}
	
	for(int i=1;i<=N;i++) {
		if(edge[i].size() == 0) printf("%lld %lld\n", val[i].fi, val[i].se);
	}
	return 0;
}