#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1<<30;
const ll INFLL = 1LL<<60;
const ll MOD = 998244343;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m; cin >> n >> m;
    vector<vector<int>> G(n);
    for (int i = 0; i < m; i++){
        int u, v; cin >> u >> v;
        u--; v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    
    //queue<pair<int, int>> q;
    queue<int> q;
    vector<bool> visited(n, false); visited[0] = true;
    vector<int> ans(2); ans[1] = 1;
    q.emplace(0);
    for (int i = 0; i < n; i++){
        queue<int> nq;
        while (!q.empty()){
            int v = q.front(); q.pop();
            for (int nv : G[v]){
                if (visited[nv]) continue;
                visited[nv] = true;
                ans[i % 2]++;
                nq.emplace(nv);
            }
        }
        q = nq;
        cout << ans[i % 2] << endl;
    }
    return 0;
}