题1003

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
int n,m;
int height = 1;
vector <int> child[110];
int depth[110] = {0};
void dfs(int i,int h)
{
	height = max(height,h);
	if(child[i].size() == 0)
	depth[h]++; 
	for(int j = 0; j < child[i].size(); j++)
	{
		dfs(child[i][j],h+1);
	}
}
int main()
{

	scanf("%d %d",&n,&m);
	int k,t,q;
	for(int i = 0; i < m; i++)
	{
		scanf("%d %d",&k,&t);
		while(t--)
		{
			scanf("%d",&q);
			child[k].push_back(q);
		}
	}
	dfs(1,1);
	for(int i = 1; i <= height; i++)
	{
		if(i != 1) printf(" ");
		printf("%d",depth[i]);
	}
	return 0;
}