from fractions import Fraction

def dfs(node, path_flow, adj_list, visited):
    visited[node] = True
    
    if not adj_list[node]:
        return {node: path_flow}
    
    flows = {}
    for neighbor, flow in adj_list[node]:
        if not visited[neighbor]:
            subflows = dfs(neighbor, path_flow * flow, adj_list, visited)
            for key, value in subflows.items():
                if key in flows:
                    flows[key] += value
                else:
                    flows[key] = value
    return flows

def water_distribution(n, m, adj_list):
    visited = [False] * (n + 1)
    flows = dfs(1, Fraction(1, 1), adj_list, visited)
    results = sorted(flows.items(), key=lambda x: x[0])
    return results

# 输入处理
n, m = map(int, input().split())
adj_list = {i: [] for i in range(1, n+1)}

for i in range(1, n+1):
    line = list(map(int, input().split()))
    d = line[0]
    targets = line[1:]
    
    if d > 0:
        flow = Fraction(1, d)
        adj_list[i] = [(t, flow) for t in targets]

# 计算结果
result = water_distribution(n, m, adj_list)

# 输出结果
for k, v in result:
    print(v.numerator, v.denominator)