mod = 1000000007
eps = 10**-9


def main():
    import sys
    from collections import deque
    input = sys.stdin.buffer.readline

    class UnionFind():
        def __init__(self, n):
            self.n = n
            self.root = [-1] * (n + 1)
            self.rnk = [0] * (n + 1)

        def find_root(self, x):
            while self.root[x] >= 0:
                x = self.root[x]
            return x

        def unite(self, x, y):
            x = self.find_root(x)
            y = self.find_root(y)
            if x == y:
                return
            elif self.rnk[x] > self.rnk[y]:
                self.root[x] += self.root[y]
                self.root[y] = x
            else:
                self.root[y] += self.root[x]
                self.root[x] = y
                if self.rnk[x] == self.rnk[y]:
                    self.rnk[y] += 1

        def isSameGroup(self, x, y):
            return self.find_root(x) == self.find_root(y)

        def size(self, x):
            return -self.root[self.find_root(x)]

    N, M = map(int, input().split())
    ans = [1] * (N+1)
    UF = UnionFind(N)
    adj = [[] for _ in range(N+1)]
    for _ in range(M):
        a, b = map(int, input().split())
        if not UF.isSameGroup(a, b):
            sa = UF.size(a)
            sb = UF.size(b)
            if sa == sb:
                adj[a].append(b)
                adj[b].append(a)
                que = deque()
                que.append(a)
                seen = {a}
                while que:
                    v = que.popleft()
                    ans[v] *= 2
                    for u in adj[v]:
                        if u not in seen:
                            que.append(u)
                            seen.add(u)
            elif sa < sb:
                que = deque()
                que.append(a)
                seen = {a}
                while que:
                    v = que.popleft()
                    ans[v] *= 0
                    for u in adj[v]:
                        if u not in seen:
                            que.append(u)
                            seen.add(u)
                adj[a].append(b)
                adj[b].append(a)
            else:
                que = deque()
                que.append(b)
                seen = {b}
                while que:
                    v = que.popleft()
                    ans[v] *= 0
                    for u in adj[v]:
                        if u not in seen:
                            que.append(u)
                            seen.add(u)
                adj[a].append(b)
                adj[b].append(a)
            UF.unite(a, b)
    for i in range(1, N+1):
        print(pow(ans[i], mod-2, mod))


if __name__ == '__main__':
    main()