#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 1e5 + 5;
const int MAXE = 5e5 + 5;
const int MAXM = 10 + 5;

inline int read(void)
{
	int res = 0;
	char c = getchar();
	while(c<'0'||c>'9') c=getchar();
	while(c>='0'&&c<='9') res=res*10+c-'0', c=getchar();
	return res;
}

ll gcd(ll a,ll b){ return b? gcd(b,a%b): a;}
inline ll lcm(ll a,ll b){ return a / gcd(a,b) * b;}

ll pws[3][60];

struct Edge
{
	int next,to;
}e[MAXE];
int head[MAXN],etot=0, ideg[MAXN], odeg[MAXN];
inline void add(int u,int v)
{
	e[++etot] = (Edge){ head[u],v};
	head[u] = etot;
	++odeg[u]; ++ideg[v];
}

const int base = 1e9;
struct Data
{
	ll a[5];
	Data(void){ a[0] = a[1] = a[2] = a[3] = a[4] = 0;}
	Data(ll x){ a[0] = x % base; a[1] = x / base; a[2] = a[3] = a[4] = 0;}
	inline Data operator + (const Data oth) const
	{
		Data res = *this;
		for(int i=0; i<5; ++i)
		{
			res.a[i] += oth.a[i];
			if(res.a[i] >= base)
				res.a[i] -= base,
				++res.a[i+1];
		}
		return res;
	}
	inline Data operator * (const int x) const// x < base
	{
		Data res = *this;
		for(int i=0; i<5; ++i) res.a[i] *= x;
		for(int i=0; i<5; ++i)
			res.a[i+1] += res.a[i] / base,
			res.a[i] %= base;
		return res;
	}
	inline Data operator / (const int x) const
	{
		Data res;
		ll lst = 0;
		for(int i=4; i>=0; --i)
		{
			lst = lst * base + a[i];
			res.a[i] = lst / x;
			lst %= x;
		}
		return res;
	}
	inline void print(char c = 0) const
	{
		bool flag = 0;
		for(int i=4; i>=0; --i)
		{
			if(flag) printf("%09d",(int)a[i]);
			else if(a[i]) printf("%d",(int)a[i]), flag = 1;
		}
		if(!flag) printf("0");
		putchar(c);
	}
	inline int mod(int x) const
	{
		if(x==2 || x==5) return a[0] % x;
		int res = 0;
		for(int i=0; i<5; ++i) res = res + a[i] % 3;
		return res % 3;
	}
};

Data val[MAXN];

int main(void)
{
//	freopen("water.in","r",stdin);
//	freopen("water.out","w",stdout);
	
	pws[0][0] = pws[1][0] = pws[2][0] = 1;
	for(int i=1; i<60; ++i) pws[0][i] = pws[0][i-1] * 2;
	for(int i=1; i<=20; ++i) pws[1][i] = pws[1][i-1] * 3, pws[2][i] = pws[2][i-1] * 5;
	
	int n = read(), m = read();
	for(int i=1; i<=n; ++i)
	{
		int d = read();
		while(d--) add(i, read());
	}
	
	Data beg(1);
	beg = beg * pws[0][30];
	beg = beg * pws[1][12];
	beg = beg * pws[2][12];
	
	queue<int> q;
	for(int i=1; i<=m; ++i)
		val[i] = beg, q.push(i);
	while(!q.empty())
	{
		int u = q.front(); q.pop();
		if(!odeg[u]) continue;
		Data tmp = val[u] / odeg[u];
		for(int i=head[u]; i; i=e[i].next)
		{
			int v = e[i].to;
			val[v] = val[v] + tmp;
			--ideg[v];
			if(!ideg[v]) q.push(v);
		}
	}
	
	int xs[3] = {2,3,5};
	for(int i=1; i<=n; ++i) if(!odeg[i])
	{
		Data res = val[i];
		Data k = 1;
		
		int ps[3] = {30,12,12};
		for(int j=0; j<=2; ++j)
		{
			while(ps[j])
			{
				if(res.mod(xs[j])) break;
				res = res / xs[j]; --ps[j];
			}
			k = k * pws[j][ps[j]];
		}
		
		res.print(' ');
		k.print('\n');
	}
	return 0;
}