#include <bits/stdc++.h>
using namespace std;

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
  return os << p.FF << " " << p.SS;
}
template<class T>
void maxi(T& x, T y){
  if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
  if(x > y) x = y;
}


const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;

class UnionFind{
private:
  vector<int> par, rank, boss, sz;
public:
  UnionFind(int n){
	par.assign(n, 0);
	rank.assign(n, 0);
	boss.assign(n, 0);
	sz.assign(n, 1);
	for(int i=0;i<n;++i){
	  par[i] = boss[i] = i;
	}
  }

  int find(int x){
	if(par[x] == x)
	  return x;
	return (par[x] = find(par[x]));
  }

  void unite(int x, int y){
	x = find(x);
	y = find(y);
	if(x == y) return;
	int nb = -1;
	if(sz[y] < sz[x])
	  nb = boss[x];
	else if(sz[y] > sz[x])
	  nb = boss[y];
	else
	  nb = min(boss[y], boss[x]);

	if(rank[x] < rank[y]){
	  par[x] = y;
	  sz[y] += sz[x];
	  boss[y] = nb;
	}
	else{
	  par[y] = x;
	  sz[x] += sz[y];
	  boss[x] = nb;
	  if(rank[x] == rank[y])
		++rank[x];
	}
  }

  bool same(int x, int y){
	return find(x) == find(y);
  }

  int getBoss(int x){
	return boss[find(x)];
  }
};

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N, M;
  cin >> N >> M;
  UnionFind uf(N);
  REP(i,M){
	int a, b;
	cin >> a >> b;
	uf.unite(a-1, b-1);
  }
  
  REP(i,N){
	cout << uf.getBoss(i)+1 << endl;
  }

  return 0;
}