#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

struct UnionFind {
    vector<int> data;
    int sz;
    UnionFind(int sz) : data(sz, -1), sz(sz){ }
    bool unionSet(int x, int y) {
        if ((x = root(x)) == (y = root(y))) return false;
        //if (data[x] > data[y]) swap(x, y);
        data[x] += data[y]; data[y] = x; sz--;
        return true;
    }
    bool findSet(int x, int y) { return root(x) == root(y); }
    int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
    int size(int x) { return -data[root(x)]; }
    int size() { return sz; }
};

int main() {
  int n, m;
  cin >> n >> m;
  vector<int> a(m), b(m);
  for (int i = 0; i < m; i++) {
    cin >> a[i] >> b[i];
    a[i]--;
    b[i]--;
  }
  UnionFind uf(n);
  for (int i = 0; i < m; i++) {
    if (uf.findSet(a[i], b[i])) {
      continue;
    }
    if (uf.size(a[i]) > uf.size(b[i])) {
      uf.unionSet(uf.root(a[i]), uf.root(b[i]));
    }
    else if (uf.size(a[i]) < uf.size(b[i])) {
      uf.unionSet(uf.root(b[i]), uf.root(a[i]));
    }
    else {
      uf.unionSet(min(uf.root(a[i]), uf.root(b[i])), max(uf.root(a[i]), uf.root(b[i])));
    }
  }
  for (int i = 0; i < n; i++) {
    cout << uf.root(i) + 1 << endl;
  }
  return 0;
}