// need
#include <iostream>
#include <algorithm>

// data structure
#include <bitset>
//#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <array>
//#include <tuple>
//#include <unordered_map>
#include <unordered_set>
#include <complex>
//#include <deque>
#include<valarray>

// stream
//#include <istream>
//#include <sstream>
//#include <ostream>
#include <fstream>

// etc
#include <cmath>
#include <cassert>
#include <functional>
#include <iomanip>
//#include <typeinfo>
#include <chrono>
#include <random>
#include <numeric>


#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n"; }

template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")";
	return os;
}

#define int ll
using ll = long long;
using ull = unsigned long long;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30;                          // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;

//Quick Find Weighted
struct QuickFindWeighted {
	std::vector<int> group;
	std::vector<std::vector<int>> items;

	QuickFindWeighted(int size) {
		group.resize(size);
		items.resize(size);
		for (int i = 0; i < size; ++i) {
			group[i] = i;
			items[i].assign({ i });
		}
	}

	// i1の所属するグループとi2の所属するグループを統合する
	void merge(int i1, int i2) {
		if (group[i1] == group[i2]) return;
		if (items[group[i1]].size() < items[group[i2]].size()) {
			std::swap(i1, i2);
		}
		int g1 = group[i1], g2 = group[i2];
		for (int i : items[g2]) group[i] = g1;
		items[g1].insert(items[g1].end(), items[g2].begin(), items[g2].end());
		items[g2].clear();
		items[g2].shrink_to_fit();
	}

	// i1とi2が同じグループに所属しているか
	bool same(int i1, int i2) {
		return group[i1] == group[i2];
	}

	int size(int i) {
		return items[group[i]].size();
	}
};

signed main() {
	INIT;
	VAR(int, n, m);
	VEC_ROW(int, m, a, b);
	std::vector<int> v(n);
	REP(i, n) v[i] = i;
	QuickFindWeighted qf(n);
	REP(i, m) {
		--a[i]; --b[i];
		if (qf.size(a[i]) < qf.size(b[i])) {
			int min = INFINT;
			for (auto x : qf.items[qf.group[b[i]]]) {
				CHMIN(min, v[x]);
			}
			for (auto x : qf.items[qf.group[a[i]]]) {
				v[x] = min;
			}
		}
		else if (qf.size(a[i]) > qf.size(b[i])) {
			int min = INFINT;
			for (auto x : qf.items[qf.group[a[i]]]) {
				CHMIN(min, v[x]);
			}
			for (auto x : qf.items[qf.group[b[i]]]) {
				v[x] = min;
			}
		}
		else {
			if (v[a[i]] == v[b[i]]) continue;
			int min = INFINT;
			for (auto x : qf.items[qf.group[a[i]]]) {
				CHMIN(min, v[x]);
			}
			for (auto x : qf.items[qf.group[b[i]]]) {
				CHMIN(min, v[x]);
			}
			for (auto x : qf.items[qf.group[a[i]]]) {
				v[x] = min;
			}
			for (auto x : qf.items[qf.group[b[i]]]) {
				v[x] = min;
			}
		}
		qf.merge(a[i], b[i]);
	}
	REP(i, n) {
		OUT(v[i] + 1)BR;
	}
	return 0;
}