#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;

int main(){
    int n,m;
    cin >> n >> m;
    vector<int> boss(n);
    vector<set<int>> num(n);
    iota(boss.begin(),boss.end(),0);
    rep(i,n) num[i].insert(i);
    rep(i,m){
        int a,b;
        cin >> a >> b;
        --a;--b;
        int bossa = boss[a],bossb = boss[b];
        if(bossa==bossb) continue;
        if((int)(num[bossa].size())>(int)(num[bossb].size())){
            swap(bossa,bossb);
        }else if((int)(num[bossa].size())==(int)(num[bossb].size())){
            if(bossa<bossb) swap(bossa,bossb);
        }
        auto it = num[bossa].begin();
        while(it!=num[bossa].end()){
            boss[*it] = bossb;
            num[bossb].insert(*it);
            it = num[bossa].erase(it);
        }
    }
    rep(i,n) cout << boss[i]+1 << endl;
    return 0;
}