#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(v) v.begin(),v.end()
#define dbg(x) cerr << #x << ": " << (x) << endl;
template<class F, class S>
ostream& operator<<(ostream& os, pair<F,S>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<class Iter>
void print(Iter beg, Iter end) {
    for (Iter itr = beg; itr != end; ++itr) {
        cerr << *itr << ' ';
    }
    cerr << '\n';
}
int N,M;
vector<vector<int>> G;
int main() {
    cin >> N >> M;
    G.resize(N);
    for (int i = 0; i < M; ++i) {
        int a,b; cin >> a >> b;
        --a; --b;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    if (G[0].empty()) {
        for (int i = 0; i < N; ++i) {
            cout << "0\n";
        }
        return 0;
    }
    vector<int> dis(N,1e9);
    queue<int> q;
    dis[0] = 0;
    q.push(0);
    while (q.size()) {
        int pos = q.front(); q.pop();
        for (int to : G[pos]) {
            if (dis[to] > dis[pos] + 1) {
                dis[to] = dis[pos] + 1;
                q.push(to);
            }
        }
    }
    // print(ALL(dis));
    vector<int> cnt(N+1);
    int iso = 0;
    for (int i = 0; i < N; ++i) {
        if (dis[i] == 1e9) ++iso;
        else cnt[dis[i]]++;
    }
    int even=1, odd=0;
    for (int i = 1; i <= N; ++i) {
        (i % 2 == 0 ? even : odd) += cnt[i];
        cout << (i%2==0 ? even : odd) << '\n';
    }
}