using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
        // Test();
    }
    static void Test()
    {
        var r = new Random();
        var count = 0;
        while (true)
        {
            var n = 10;
            var m = r.Next(n) + 1;
            var map = Make(r, n, m);
            // 愚直解
            var s1 = All(n, m, map);
            // 作成解
            var s2 = Mame(n, m, map);
            var flg = true;
            for (var i = 0; i < s1.Length; ++i) if (s1[i] != s2[i]) flg = false;
            if (!flg)
            {
                WriteLine(n + " " + m);
                WriteLine(string.Join("\n", map.Select(m => string.Join(" ", m))));
                // WriteLine(string.Join(" ", a));
                WriteLine(string.Join(" ", s1));
                WriteLine(string.Join(" ", s2));
                return;
            }
            ++count;
            if (count % 1000 == 0) WriteLine(count);
        }
    }
    static int[] All(int n, int m, int[][] map)
    {
        var tree = new List<int>[n];
        for (var i = 0; i < n; ++i) tree[i] = new List<int>();
        foreach (var edge in map)
        {
            tree[edge[0] - 1].Add(edge[1] - 1);
            tree[edge[1] - 1].Add(edge[0] - 1);
        }
        var dp = new int[n];
        dp[0] = 1;
        var ans = new int[n];
        for (var i = 0; i < n; ++i)
        {
            for (var j = 0; j < n; ++j) foreach (var ni in tree[j]) if (dp[j] == 0 && dp[ni] == 1) dp[j] = 2;
            for (var j = 0; j < n; ++j) if (dp[j] == 1) dp[j] = 0;
            for (var j = 0; j < n; ++j) if (dp[j] == 2) dp[j] = 1;
            ans[i] = dp.Count(di => di == 1);
        }
        return ans;
    }
    static int[][] Make(Random r, int n, int m)
    {
        var ans = new List<int[]>();
        for (var i = 0; i < n; ++i) for (var j = i + 1; j < n; ++j) ans.Add(new int[] { i + 1 , j + 1 });
        for (var i = ans.Count - 2; i >= 0; --i)
        {
            var pos = r.Next(i, ans.Count);
            (ans[i], ans[pos]) = (ans[pos], ans[i]);
        }
        return ans.Take(m).ToArray();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var map = NArr(m);
        WriteLine(string.Join("\n", Mame(n, m, map)));
    }
    static int[] Mame(int n, int m, int[][] map)
    {
        var tree = new List<int>[n];
        for (var i = 0; i < n; ++i) tree[i] = new List<int>();
        foreach (var edge in map)
        {
            tree[edge[0] - 1].Add(edge[1] - 1);
            tree[edge[1] - 1].Add(edge[0] - 1);
        }
        if (tree[0].Count == 0)
        {
            return Enumerable.Repeat(0, n).ToArray();
        }
        var dep = Enumerable.Repeat(int.MaxValue / 2, n).ToArray();
        dep[0] = 0;
        DFS(0, -1, tree, dep);
        var ans = new int[n + 1];
        for (var i = 0; i < n; ++i) if (dep[i] <= n) ++ans[dep[i]];
        for (var i = 2; i <= n; ++i) ans[i] += ans[i - 2];
        return ans.Skip(1).ToArray();
    }
    static void DFS(int cur, int prev, List<int>[] tree, int[] dep)
    {
        foreach (var next in tree[cur])
        {
            if (prev == next) continue;
            if (dep[next] <= dep[cur] + 1) continue;
            dep[next] = dep[cur] + 1;
            DFS(next, cur, tree, dep);
        }
    }
}