class Unionfind:
     
    def __init__(self,n):
        self.uf = [-1]*n
        self.leader = [[i] for i in range(n)]
        self.prob = [1]*n
 
    def find(self,x):
        if self.uf[x] < 0:
            return x
        else:
            self.uf[x] = self.find(self.uf[x])
            return self.uf[x]
 
    def same(self,x,y):
        return self.find(x) == self.find(y)
 
    def union(self,x,y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if self.uf[x] > self.uf[y]:
            x,y = y,x
        if self.uf[x] == self.uf[y]:
            self.prob[x] *= 500000004
            self.prob[x] %= mod
            self.leader[x] += self.leader[y]
        self.uf[x] += self.uf[y]
        self.uf[y] = x
        self.leader[y] = []
        self.prob[y] = 0
        return True
 
    def size(self,x):
        x = self.find(x)
        return -self.uf[x]

n,m = map(int,input().split())
uf = Unionfind(n)
mod = 10**9+7
for i in range(m):
    a,b = map(int,input().split())
    uf.union(a-1,b-1)

ans = [0]*n
for i in range(n):
    if uf.find(i) != i:
        continue
    for j in uf.leader[i]:
        ans[j] = uf.prob[i]
for i in ans:
    print(i)