#include "bits/stdc++.h"

#ifdef WINT_MIN
#define __MAI
#endif

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define debugaar(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define repeat(l) for(auto cnt=0;cnt<(l);++cnt)
#define BIGINT 0x7FFFFFFF
#define E107 1000000007ll
void printbit(int u) { if (u == 0)cout << 0; else { int s = 0, k = 0; for (; 0<u; u >>= 1, k++)s = (s << 1) | (u & 1); for (; 0<k--; s >>= 1)cout << (s & 1); } }template<typename T1, typename T2>
    ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())

namespace {
    std::chrono::system_clock::time_point t;
    void tic() { t = TIME; }
    void toc() { fprintf(stderr, "TIME : %lldms\n", MILLISEC(TIME - t)); }
    std::chrono::system_clock::time_point tle = TIME;
#ifdef __MAI
    void safe_tle(int msec) { assert(MILLISEC(TIME - tle) < msec); }
#else
#define safe_tle(k) ;
#endif
}

#ifndef __MAI 
namespace {
    class MaiScanner {
    public:
        template<typename T>
        void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        void ign() { getchar_unlocked(); }
        MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
    };
}
MaiScanner scanner;
#else
#define scanner cin
#endif


// 親分，あるいは上司のINDEXが入る．自分が親分ならば，自分のIDを格納する．
int leader[100010];
// 親分が引き連れるグループの大きさを格納する．
int gsize[100010];

int nquery, n;



// 親分のINDEXを求める．
// 詳しくは説明しないが，UnionFindの知識が必要．
int u_find(int v) {
    if (leader[v] == v) return v;
    return leader[v] = u_find(leader[v]);
}

// チームAにチームBを結合する．
void u_union(int vwin, int vlose) {
    int lwin = u_find(vwin);
    int llose = u_find(vlose);

    leader[llose] = lwin;
    gsize[lwin] += gsize[llose];
}



int main() {
    int i, j, k;
    int x, y, a, b;

    scanner >> n >> nquery;

    assert(1 < n && n <= 10000);
    assert(1 < nquery && nquery <= n);

    // 初期化
    repeat(n + 1) {
        leader[cnt] = cnt;
        gsize[cnt] = 1;
    }

    repeat(nquery) {
        scanner >> a >> b;

        assert(1 <= a && a <= n);
        assert(1 <= b && b <= n);

        int la = u_find(a); // チームのリーダ
        int lb = u_find(b);  
        int sa = gsize[la]; // チームの大きさ
        int sb = gsize[lb];

        if (la != lb){
                
            if (sa < sb || (sa == sb && lb < la)) {
                // Bが勝つ
                u_union(lb, la);
            }
            else {
                // Aが勝つ
                u_union(la, lb);
            }
            
        }
    }

    repeat(n) {
        cout << u_find(cnt + 1) << endl;
    }

    return 0;
}