/* -*- coding: utf-8 -*-
 *
 * 2888.cc:  No.2888 Mamehinata - yukicoder
 */

#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

using vi = vector<int>;
using qi = queue<int>;

/* global variables */

vi nbrs[MAX_N];
int ds[MAX_N], cs[MAX_N + 1];

/* subroutines */

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--, v--;
    nbrs[u].push_back(v);
    nbrs[v].push_back(u);
  }

  fill(ds, ds + n, -1);
  ds[0] = 0;
  qi q;
  q.push(0);

  while (! q.empty()) {
    int u = q.front(); q.pop();
    cs[ds[u]]++;
    for (auto v: nbrs[u])
      if (ds[v] < 0)
	ds[v] = ds[u] + 1, q.push(v);
  }

  int ss[2] = {1, 0};
  for (int i = 1; i <= n; i++) {
    int p = (i & 1);
    ss[p] += cs[i];
    printf("%d\n", ss[p]);
  }
  
  return 0;
}