#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
template<class T>inline int popcount(T a) {return __builtin_popcount(a);}
template<class T>inline T emod(T a, T p) { return (a%p + p) % p;}
//-------------------
class UnionFind {
private:
	unsigned size_; std::vector<int> par, rank; //par = root? -size: par 
public:
	UnionFind() : size_(0), par(std::vector<int>()), rank(std::vector<int>()) {};
	UnionFind(unsigned size__) : size_(size__) {
		par.resize(size_+1); rank.resize(size_+1);
		for (unsigned i = 0; i <= size_; i++) par[i] = -1, rank[i] = 0;
	}
	//unsigned size() { return size_; }
	unsigned root(unsigned x) {return par[x] < 0 ? x : par[x] = root(par[x]); }
	bool same(unsigned x, unsigned y) { return root(x) == root(y); }
	void unite(unsigned x, unsigned y) {
        unsigned prev_x = x, prev_y = y;
		x = root(x), y = root(y);
        if(x==y) return;
		if (size(x) < size(y))par[y] += par[x], par[x] = y;
		else if (size(x) == size(y) and x < y)par[x] += par[y], par[y] = x, rank[x]++;
        else if (size(x) == size(y)) par[y] += par[x], par[x] = y, rank[y]++;
		else par[x] += par[y], par[y] = x;
	}
	int size(int x){ return -par[root(x)];} 
	bool operator==(const UnionFind &u) { return par == u.par; }
	bool operator!=(const UnionFind &u) { return par != u.par; }
};
int main() {
    cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15);
    int n,m; cin >> n >> m;
    UnionFind uf(n);
    rep(i, m) {
        int a,b; cin >> a >> b; a--; b--;
        uf.unite(a,b);   
    }

    // vector<int> mp(n, INF);
    // rep(i, n) {
    //     chmin(mp[uf.root(i)], i);
    // }

    // rep(i, n) cout << mp[uf.root(i)]+1 << endl;
    rep(i, n) {
        cout << uf.root(i)+1 << endl;
    }
    return 0;
}