from collections import Counter
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 9


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

    def find(self, x):
        stack = []
        while self.root[x] >= 0:
            stack.append(x)
            x = self.root[x]
        for i in stack:
            self.root[i] = x
        return x

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if self.rank[x] < self.rank[y]:
            self.root[y] += self.root[x]
            self.root[x] = y
        else:
            self.root[x] += self.root[y]
            self.root[y] = x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
        return True

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


N, M = map(int, input().split())
uf = UF_tree(N)
for _ in range(M):
    a, b = map(int, input().split())
    uf.unite(a-1, b-1)

leader = {uf.find(i) for i in range(N)}
cnt = [uf.size(i) for i in leader]

dp = [inf] * (N + 1)
dp[0] = 0
for W, total in Counter(cnt).items():
    k = 1
    while total > 0:
        mul = min(k, total)
        for i in reversed(range(W * mul, N+1)):
            dp[i] = min(dp[i], dp[i - W * mul] + mul)
        total -= mul
        k *= 2

for i in range(1, N+1):
    if dp[i] > N + 5:
        print(-1)
    else:
        print(dp[i] - 1)