CF1167C.News Distribution

In some social network, there are $n$ users communicating with each other in $m$ groups of friends. Let's analyze the process of distributing some news between users.

Initially, some user $x$ receives the news from some source. Then he or she sends the news to his or her friends (two users are friends if there is at least one group such that both of them belong to this group). Friends continue sending the news to their friends, and so on. The process ends when there is no pair of friends such that one of them knows the news, and another one doesn't know.

For each user $x$ you have to determine what is the number of users that will know the news if initially only user $x$ starts distributing it.

在某个社交网络中，有 $n$ 个用户通过 $m$ 个朋友群组相互交流。我们来分析新闻在用户之间传播的过程。

初始时，某位用户 $x$ 从某个信源接收到新闻。随后，该用户将其转发给自己的所有好友（若存在至少一个群组同时包含两名用户，则称这两名用户互为好友）。好友们继续将新闻转发给各自的好友，依此类推。当不存在这样一对好友：其中一人已知新闻而另一人尚不知时，传播过程结束。

对每位用户 $x$，你需要计算：若仅由用户 $x$ 初始发起新闻传播，最终共有多少名用户会得知该新闻。

The first line contains two integers $n$ and $m$ ($1 \le n, m \le 5 \cdot 10^5$) — the number of users and the number of groups of friends, respectively.

Then $m$ lines follow, each describing a group of friends. The $i$-th line begins with integer $k_i$ ($0 \le k_i \le n$) — the number of users in the $i$-th group. Then $k_i$ distinct integers follow, denoting the users belonging to the $i$-th group.

It is guaranteed that $\sum \limits_{i = 1}^{m} k_i \le 5 \cdot 10^5$.

第一行包含两个整数 $n$ 和 $m$（$1 \le n, m \le 5 \cdot 10^5$），分别表示用户数量和好友群组数量。

接下来是 $m$ 行，每行描述一个好友群组。第 $i$ 行以整数 $k_i$（$0 \le k_i \le n$）开头，表示第 $i$ 个群组中的用户数量；随后是 $k_i$ 个互不相同的整数，表示属于第 $i$ 个群组的用户编号。

保证 $\sum \limits_{i = 1}^{m} k_i \le 5 \cdot 10^5$。

Print $n$ integers. The $i$-th integer should be equal to the number of users that will know the news if user $i$ starts distributing it.

输出 $n$ 个整数。其中第 $i$ 个整数应等于：若由用户 $i$ 开始传播该消息，则最终知晓该消息的用户总数。