#include <bits/stdc++.h>
#define int __int128
using namespace std;
const int N = 1e5 + 5;
int n, m;
vector<int> e[N];
int rd[N];
struct fc {
  int p, q; // p:·Ö×Ó,q:·Öĸ 
  inline fc(int P = 0, int Q = 1LL) {
    this->p = P, this->q = Q;
  }
};
inline int gcd(int a, int b) {
  if (!b)
    return a;
  return gcd(b, a % b);
}
inline fc operator + (const fc &x, const fc &y) {
  return fc(x.p * y.q + x.q * y.p, x.q * y.q);
}
inline fc yf(const fc &x) {
  int GCD = gcd(x.p, x.q);
  return fc(x.p / GCD, x.q / GCD);
}
fc ans[N];
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-')
      f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 1) + (x << 3) + (ch & 15);
    ch = getchar();
  }
  return x * f;
}
inline void top_sort() {
  queue<int> fuck;
  for (int i = 1; i <= m; ++i) {
    if (rd[i] == 0) {
      fuck.push(i);
      ans[i] = fc(1, 1);
    }
  }
  while (fuck.size()) {
    int u = fuck.front();
    fuck.pop();
    fc temp = fc(ans[u].p, ans[u].q * e[u].size());
    temp = yf(temp);
    for (int i = 0; i < e[u].size(); ++i) {
      int ver = e[u][i];
      if (--rd[ver] <= 0) {
        fuck.push(ver);
      }
      ans[ver] = ans[ver] + temp;
      ans[ver] = yf(ans[ver]);
    }
  }
}
inline void wt(int x)
{
	if(x>9)wt(x/10);
	putchar((x%10)^48);
}
signed main() {
 // freopen("water.in", "r", stdin);
 // freopen("water.out", "w", stdout);
  n = read(), m = read();
  for (int i = 1; i <= n; ++i) {
    int Size = read();
    while (Size--) {
      int x = read();
      rd[x]++;
      e[i].push_back(x);
    }
  }
  top_sort();
  for (int i = 1; i <= n; ++i) {
    if (e[i].size() == 0) {
wt(ans[i].p);putchar(' ');wt(ans[i].q);putchar('\n');
    }
  }
 // fclose(stdin);
 // fclose(stdout);
  return 0;
}