#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m;
    cin >> n >> m;
    vector<vector<int>> g(n);
    rep(i,m){
        int u,v;
        cin >> u >> v;
        --u, --v;
        g[u].emplace_back(v);
        g[v].emplace_back(u);
    }
    if(!g[0].size()){
        rep(i,n) cout << "0\n";
        return 0;
    }
    vector<int> dist(n,INF), cnt(n+1,0);
    dist[0] = 0;
    queue<int> que;
    que.emplace(0);
    while(que.size()){
        int now = que.front();
        que.pop();
        for(int x:g[now]){
            if(chmin(dist[x], dist[now]+1)) que.emplace(x);
        }
    }
    rep(i,n) if(dist[i]<n) cnt[dist[i]] += 1;
    int ans[] = {1,0};
    for(int i=1;i<=n;++i){
        ans[i&1] += cnt[i];
        cout << ans[i&1] << '\n';
    }
    return 0;
}