#include<bits/stdc++.h>
using namespace std;
using lll=__int128;
const int N=1e5+9;
int n,m,deg[N];
vector<int> G[N];
void out(lll x){
	if(x>9)out(x/10);
	putchar(x%10+'0');
}
struct frac{
	lll x,y;
	frac(){x=0,y=1;}
	frac(lll _x,lll _y){
		x=_x,y=_y;
		lll g=__gcd(x,y);
		//out(x),putchar('/'),out(y),putchar(':'),out(g),putchar('\n');
		x/=g,y/=g;
	}
	friend frac operator+(const frac &a,const frac &b){
		lll g=__gcd(a.y,b.y);
		lll y=a.y/g*b.y;
		//out(a.x),putchar('/'),out(a.y),putchar('\n');
		//out(b.x),putchar('/'),out(b.y),putchar('\n');
		//out(y/a.y*a.x+y/b.y*b.x),putchar('/'),out(y),putchar('\n');
		return frac(y/a.y*a.x+y/b.y*b.x,y);
	}
	friend frac operator*(const frac &a,const frac &b){
		return frac(a.x*b.x,a.y*b.y);
	}
}f[N];
int main(){
#ifdef memset0
	freopen("A.in","r",stdin);
#endif
	cin.tie(0)->sync_with_stdio(0);
	cin>>n>>m;
	for(int k,i=1;i<=n;i++){
		cin>>k;
		G[i].resize(k);
		for(int &x:G[i]){
			cin>>x;
			deg[x]++;
		}
	}
	for(int i=1;i<=m;i++)f[i].x=1;
	queue<int> q;
	for(int i=1;i<=n;i++)
		if(!deg[i]){
			q.push(i);
		}
	while(q.size()){
		int u=q.front();
		q.pop();
		if(G[u].empty())continue;
		frac t(f[u].x,f[u].y*G[u].size());
		for(int v:G[u]){
			--deg[v];
			if(!deg[v]){
				q.push(v);
			}
			f[v]=f[v]+t;
		}
	}
	for(int i=1;i<=n;i++)
		if(G[i].empty()){
			out(f[i].x);
			putchar(' ');
			out(f[i].y);
			putchar('\n');
		}
}