#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

const ll INF = 1e18;
void solve() {
  ll n, m;
  cin >> n >> m;
  vector g(n, vector<ll>());
  rep(mi, m) {
    ll u, v;
    cin >> u >> v, u--, v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  vector<ll> dist(n, INF), cnt(n + 1, 0);
  dist[0] = 0;
  cnt[dist[0]] += 1;
  deque<ll> que;
  que.push_back(0);
  while (!que.empty()) {
    ll u = que.front();
    que.pop_front();
    for (const auto v : g[u]) {
      if (dist[v] <= dist[u] + 1)
        continue;
      dist[v] = dist[u] + 1;
      cnt[dist[v]] += 1;
      que.push_back(v);
    }
  }
  vector<ll> ans(2, 0);
  ans[0] += 1;
  for (ll i = 1; i <= n; i++) {
    ans[i % 2] += cnt[i];
    cout << ans[i % 2] << '\n';
  }
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}