#include <bits/stdc++.h>
using namespace std;

#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y

#define ASSERT(expr...) assert((expr))

using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;

using f32 = float;
using f64 = double;
// }}}

constexpr i64 INF = 1'010'000'000'000'000'017LL;

constexpr i64 MOD = 998244353LL;

constexpr f64 EPS = 1e-12;

constexpr f64 PI = 3.14159265358979323846;

#define M5 100007
#define M9 1000000000

#define F first
#define S second

// util {{{
#define FOR(i, start, end) for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)

#define all(x) (x).begin(), (x).end()
#define ll long long int
#define VI vector<ll>
#define VVI vector<VI>

#define ISD true
#define debug(x) \
    if (ISD)     \
    cout << #x << ": " << x << endl

template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {})
{
    if (comp(xmax, x))
    {
        xmax = x;
        return true;
    }
    return false;
}

template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {})
{
    if (comp(x, xmin))
    {
        xmin = x;
        return true;
    }
    return false;
}

int main()
{
    int N, M;
    cin >> N >> M;
    vector<vector<int>> G(N);
    REP(i, M)
    {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    if (G[0].size() == 0)
    {
        REP(i, N)
        {
            cout << 0 << endl;
        }
        return 0;
    }

    vector<int> d(N, -1); // 既に見たことがある頂点か記録する
    queue<int> que;
    que.emplace(0); // sから探索する
    d[0] = 0;
    while (que.size() != 0)
    {                            // 幅優先探索
        int state = que.front(); // 現在の状態
        que.pop();
        for (auto next : G[state])
        {
            if (d[next] == -1)
            { // 未探索の時のみ行う
                d[next] = d[state] + 1;
                que.emplace(next); // 次の状態をqueueへ格納
            }
        }
    }
    map<int, int> MP;

    vector<ll> bw(2);

    REP(i, N)
    {
        MP[d[i]]++;
    }
    bw[0]++;
    REP(i, N)
    {
        cout << bw[(i + 1) % 2] + MP[i + 1] << endl;
        bw[(i + 1) % 2] += MP[i + 1];
    }
}