from collections import Counter


class UnionFind:
    def __init__(self, n):
        self.par = list(range(n))

    def find(self, x):
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        self.par[x] = y


def solve():
    N, M = map(int, input().split())
    uf = UnionFind(N)
    for i in range(M):
        u, v = map(int, input().split())
        uf.union(u - 1, v - 1)

    for i in range(N):
        uf.find(i)

    co = Counter(uf.par)

    gs = []
    for k in co:
        gs.append(co[k])

    inf = float('inf')

    dp = [inf] * (N + 1)
    dp[0] = -1

    for g in gs:
        for i in range(N, -1, -1):
            if dp[i] != inf and i + g <= N:
                dp[i + g] = min(dp[i + g], dp[i] + 1)

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


if __name__ == '__main__':
    solve()