//最终用了个四不像，来实现数组，自己指针没学好啊 
typedef struct {
    int childNum;
    int childs[100];
}Node;


/*
2 1
01 1 02
*/
int main()
{
    int N = 0;
    int M = 0;
    scanf("%d %d", &N, &M);
    Node data[N+1];//结构体一定要自己初始化 
    int n = 0;
    for(; n < N+1; n++)
    {
        data[n].childNum = 0;
        int i = 0;
        for(; i < 100; i++)
        {
            data[n].childs[i] = -1;
        }
    }
    int i = 0;
    for(; i < M; i++)
    {
        int k = 0;
        int ID = 0;
        scanf("%d %d", &ID, &k);
        data[ID].childNum = k;
        int j = 0;
        for(; j < k; j++)
        {
            scanf("%d", &data[ID].childs[j]);
        }
    }
    
    int level = 0;
    int result[100] = {0}; //数组初始化 
    int thisLevel[100];
    thisLevel[0] = 1;
    int thisLevelNum = 1;
    int nextLevel[100];
    int nextLevelNum = 0;
    
    while(1)
    {
        int i = 0;
        for(; i < thisLevelNum; i++)
        {
            int childNum = data[thisLevel[i]].childNum;
            
            if(childNum == 0)
            {
                result[level] += 1;
            }
            else
            {
                int j = 0;
                for(; j < childNum; j++)
                {
                    nextLevel[nextLevelNum] = data[thisLevel[i]].childs[j];
                    nextLevelNum++;
                }
            }
        }
        
        if(nextLevelNum == 0)
        {
            break;
        }
        
        int j = 0;
        for(; j < nextLevelNum; j++)
        {
            thisLevel[j] = nextLevel[j];
        }
        
        thisLevelNum = nextLevelNum;
        nextLevelNum = 0;
        level++;
    }
    
    printf("%d", result[0]);
    int j = 1;
    for(; j < level+1; j++)
    {
        printf(" %d", result[j]);
    }
    
    return 0;
}