import sys
input = sys.stdin.readline

mod=10**9+7

n,m=map(int,input().split())

# UnionFind

Group = [i for i in range(n)] # グループ分け
Nodes = [1]*n # 各グループのノードの数

def find(x):
    while Group[x] != x:
        x=Group[x]
    return x

def Union(x,y):
    if find(x) != find(y):
        if Nodes[find(x)] < Nodes[find(y)]:
            
            #Nodes[find(y)] += Nodes[find(x)]
            #Nodes[find(x)] = 0
            Group[find(x)] = find(y)
            
        else:
            #Nodes[find(x)] += Nodes[find(y)]
            #Nodes[find(y)] = 0
            Group[find(y)] = find(x)

OK=[1]*n

for i in range(m):
    x,y=map(int,input().split())

    x-=1
    y-=1

    k=find(x)
    l=find(y)

    if Nodes[k]<Nodes[l]:
        OK[k]=0
    elif Nodes[k]>Nodes[l]:
        OK[l]=0
    else:
        Union(k,l)
        nx=find(k)

        plus=Nodes[k]+Nodes[l]
        Nodes[k]=0
        Nodes[l]=0
        Nodes[nx]=plus

ANS=[0]*n

for i in range(n):
    if OK[find(i)]==0:
        print(0)
    else:
        x=Nodes[find(i)]

        print(pow(x,mod-2,mod))