from collections import deque, Counter
from sys import stdin, stdout
ss = [map(int, s.split()) for s in stdin.readlines()]
n, m = ss[0]
n1 = n+1

parent = [1] + range(1,n1)
count = [1]*n1
def root(x):
    p = parent[x]
    if x!=p:
        parent[x] = x = root(p)
    return x
for u, v in ss[1:]:
    a = root(u); b = root(v)
    if a!=b:
        if a<b:
            parent[b] = a
            count[a] += count[b]
        else:
            parent[a] = b
            count[b] += count[a]
ct = Counter(c for i, c in enumerate(count) if parent[i]==i)

deq = deque()
clear = deq.clear
pop = deq.pop
popleft = deq.popleft
append = deq.append

dp = [-1]+[n]*n
for i, c in ct.items():
    for a in xrange(i):
        clear()
        for j, idx in enumerate(range(a, n1, i)):
            p = (dp[idx]-j, -j)
            while deq and p <= deq[-1]:
                pop()
            append(p)
            v, u = deq[0]
            dp[idx] = v + j
            if c==j+u:
                popleft()

dp = [v if v!=n else -1 for v in dp]
stdout.write("\n".join(map(str, dp[1:])) + "\n")