import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] # inf = -1-(-1 << 31) inf = -1-(-1 << 63) md = 10**9+7 # md = 998244353 class UnionFind: def __init__(self, n): self._tree = [-1]*n # number of connected component self.cnt = n self._top = list(range(n)) def root(self, u): stack = [] while self._tree[u] >= 0: stack.append(u) u = self._tree[u] for v in stack: self._tree[v] = u return u def same(self, u, v): return self.root(u) == self.root(v) def merge(self, u, v, i): u, v = self.root(u), self.root(v) self._top[u] = self._top[v] = i if u == v: return False if self._tree[u] > self._tree[v]: u, v = v, u self._tree[u] += self._tree[v] self._tree[v] = u self.cnt -= 1 return True # size of connected component def size(self, u): return -self._tree[self.root(u)] def top(self, u): return self._top[self.root(u)] n, m = LI() uf = UnionFind(n) dp = [0]*(n+m) to = [[] for _ in range(n+m)] for i in range(m): a, b = LI1() u, v = uf.top(a), uf.top(b) if u == v: to[i+n].append(u) else: to[i+n] += [u, v] su = uf.size(a) sv = uf.size(b) if su == sv: dp[i+n] = 1 if su < sv: dp[u] = -1 if su > sv: dp[v] = -1 uf.merge(a, b, i+n) fin = [0]*(n+m) for u in range(n+m)[::-1]: if fin[u]: continue st = [u] while st: u = st.pop() fin[u] = 1 for v in to[u]: if dp[u] == -1 or dp[v] == -1: dp[v] = -1 else: dp[v] += dp[u] st.append(v) inv = (md+1)//2 for d in dp[:n]: if d == -1: print(0) else: print(pow(inv, d, md))