/*
    Author:zeke
    
    pass System Test!
    GET AC!!
*/
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <stack>
#include <bitset>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
    ll(s);      \
    cin >> (s);
#define Scin(s) \
    ll(s);      \
    cin >> (s);
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
ll MOD = 1e9 + 7;
ll INF = 1e18;
struct UnionFind
{
    vector<int> par; // par[i]:iの親の番号　(例) par[3] = 2 : 3の親が2
    vector<int> num;
    UnionFind(int N) : par(N), num(N)
    { //最初は全てが根であるとして初期化
        for (int i = 0; i < N; i++)
        {
            par[i] = i;
            num[i] = 1;
        }
    }

    int root(int x)
    { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
        if (par[x] == x)
            return x;
        return par[x] = root(par[x]);
    }

    void unite(int x, int y)
    {                     // xとyの木を併合
        int rx = root(x); //xの根をrx
        int ry = root(y); //yの根をry
        if (rx == ry)
            return;   //xとyの根が同じ(=同じ木にある)時はそのまま
        par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
        num[ry] += num[rx];
        num[rx]=0;
    }

    bool same(int x, int y)
    { // 2つのデータx, yが属する木が同じならtrueを返す
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }
};
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n, m;
    cin >> n >> m;
    UnionFind tree(n);
   // V reg(n);
   
    rep(k, m)
    {
        ll a, b;
        cin >> a >> b;
       
        a--;
        b--;
      //  cout<<a<<" "<<b<<endl;
      
        if (tree.root(a) == tree.root(b))
            continue;
        if (tree.num[tree.root(a)] > tree.num[tree.root(b)])
        {
            tree.unite(b, a);
          //  cout<<a<<" "<<b<<endl;
        }
        else if (tree.num[tree.root(a)] < tree.num[tree.root(b)])
        {
            tree.unite(a, b);
        }    
        else
        {
            //cout<<tree.root(a)<<" "<<tree.root(b)<<endl;
            if (tree.root(a) < tree.root(b))
            {
                
                tree.unite(b, a);
            }
            else if (tree.root(a) > tree.root(b))
            {
                
                tree.unite(a, b);
            }
        }
      /*  cout << k << endl;
        rep(j, n)
        {
            cout << tree.num[j] << " ";
        }
        cout << endl;*/
    }
    rep(i, n)
    {
        cout << tree.root(i) + 1 << endl;
    }
}