def modinv(a, m):
    b, u, v = m, 1, 0
    while b != 0:
        t = a // b
        a -= t * b
        a, b = b, a
        u -= t * v
        u, v = v, u
    u %= m
    if u < 0:
        u += m
    return u

par = []
mem = []
prb = []

def init(n):
    for i in range(n):
        par.append(i)
        mem.append(1)
        prb.append(1)
        
def find(x):
    if par[x] == x:
        return x
    else:
        return find(par[x])
    
def unite(x, y):
    x = find(x)
    y = find(y)
    if x == y:
        return
    if mem[x] > mem[y]:
        par[y] = x
        mem[x] += mem[y]
        mem[y] = 0
        prb[y] = 0
    else:
        par[x] = y
        if mem[x] == mem[y]:
            prb[y] *= 2
            prb[x] = prb[x] * 2 / prb[y]
        else:
            prb[x] = 0
        mem[y] += mem[x]
        mem[x] = 0
           
def prob(x, p):
    if prb[x] == 0:
        return 0
    if par[x] == x:
        return prb[x] * p
    else:
        return prob(par[x], p * prb[x])

N, M = map(int, input().split())

init(N)

for _ in range(M):
    a, b = map(int, input().split())
    unite(a-1, b-1)
    
    
MOD = 10**9+7
    
for i in range(N):
    p = prob(i, 1)
    if p == 0 or p == 1:
        print(p)
    else:
        print(modinv(int(p), MOD))