using System;
using System.IO;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using System.Collections.Generic;
using System.Diagnostics;
using Enu = System.Linq.Enumerable;

public class Program
{
    public void Solve()
    {
        int N = Reader.Int(), M = Reader.Int();
        var uf = new UnionFind(N);
        for (int i = 0; i < M; i++)
            uf.Unite(Reader.Int() - 1, Reader.Int() - 1);
        var count = new int[N + 1];
        var dp = new int[N + 1];
        for (int i = 1; i <= N; i++) dp[i] = N + 1;
        foreach (var c in uf.Components().Values)
            count[c.Count]++;

        for (int size = 1; size <= N; size++)
            if (count[size] > 0)
            {
                var nextdp = new int[dp.Length];
                Array.Copy(dp, nextdp, dp.Length);
                int maxDiff = size * count[size];

                for (int mod = 0; mod < size; mod++)
                {
                    var deq = new Deque<int>();
                    for (int i = mod; i <= N; i += size)
                    {
                        while (deq.Count > 0 &&
                            dp[deq.PeekBack()] + (i - deq.PeekBack()) / size >= dp[i]) deq.PopBack();
                        deq.PushBack(i);
                        int L = deq.PeekFront();
                        CheckMin(ref nextdp[i], dp[L] + (i - L) / size);
                        if (L == i - maxDiff) deq.PopFront();
                    }
                }
                dp = nextdp;
            }
        Console.WriteLine(string.Join("\n", dp.Skip(1).Select(a => a > N ? -1 : a - 1)));
    }

    bool CheckMin(ref int a, int b) { if (b < a) { a = b; return true; } return false; }

    class Deque<T>
    {
        private T[] A = new T[128];
        private int L;
        public int Count { get; private set; }

        public T PeekFront() { return A[L]; }
        public T PeekBack() { return A[(L + Count - 1) % A.Length]; }
        public void PushFront(T val)
        {
            if (Count++ == A.Length) DoubleArray();
            L = (L + A.Length - 1) % A.Length;
            A[L] = val;
        }
        public void PushBack(T val)
        {
            if (Count == A.Length) DoubleArray();
            A[(L + Count++) % A.Length] = val;
        }
        public T PopFront()
        {
            if (Count-- == 0) throw new InvalidOperationException("empty");
            T res = A[L];
            L = (L + 1) % A.Length;
            return res;
        }
        public T PopBack()
        {
            if (Count-- == 0) throw new InvalidOperationException("empty");
            return A[(L + Count) % A.Length];
        }
        void DoubleArray()
        {
            T[] next = new T[A.Length * 2];
            Array.Copy(A, L, next, 0, A.Length - L);
            Array.Copy(A, 0, next, A.Length - L, L);
            L = 0;
            A = next;
        }
    }

    class UnionFind
    {
        private int[] parent;
        private int[] rank;
        private int[] numElements;

        public UnionFind(int N)
        {
            parent = new int[N];
            rank = new int[N];
            numElements = new int[N];
            for (int i = 0; i < N; i++)
            {
                parent[i] = i;
                numElements[i] = 1;
            }
        }
        public int Root(int x)
        {
            if (parent[x] == x) return x;
            return parent[x] = Root(parent[x]);
        }
        public bool Same(int x, int y)
        {
            return Root(x) == Root(y);
        }
        public int NumElements(int x)
        {
            return numElements[Root(x)];
        }
        public bool Unite(int x, int y)
        {
            x = Root(x); y = Root(y);
            if (x == y) return false;
            if (rank[x] > rank[y]) { var t = x; x = y; y = t; }
            if (rank[x] == rank[y]) rank[y]++;
            parent[x] = y;
            numElements[y] += numElements[x];
            return true;
        }
        public Dictionary<int, List<int>> Components()
        {
            var dic = new Dictionary<int, List<int>>();
            for (int i = 0; i < parent.Length; i++)
            {
                int root = Root(i);
                if (!dic.ContainsKey(root)) dic[root] = new List<int>();
                dic[root].Add(i);
            }
            return dic;
        }
    }
}

class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    static TextReader reader = Console.In;
    static readonly char[] separator = { ' ' };
    static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    static string[] A = new string[0];
    static int i;
    static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    public static bool HasNext() { return CheckNext(); }
    public static string String() { return Next(); }
    public static int Int() { return int.Parse(Next()); }
    public static long Long() { return long.Parse(Next()); }
    public static double Double() { return double.Parse(Next()); }
    public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
    public static int[] IntArray(int N) { return Range(N, Int); }
    public static int[][] IntTable(int H) { return Range(H, IntLine); }
    public static string[] StringArray(int N) { return Range(N, Next); }
    public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); }
    public static string Line() { return reader.ReadLine().Trim(); }
    static string[] Split(string s) { return s.Split(separator, op); }
    static T[] Range<T>(int N, Func<T> f) { var r = new T[N]; for (int i = 0; i < N; r[i++] = f()) ; return r; }
    static string Next() { CheckNext(); return A[i++]; }
    static bool CheckNext()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return CheckNext();
        A = Split(line);
        i = 0;
        return true;
    }
}