#include <bits/stdc++.h>
using namespace std;

struct union_find_tree {
    std::vector<int> par, rank;
    union_find_tree(){}
    union_find_tree(int size)
    {
        par=std::vector<int>(size);
        rank=std::vector<int>(size);
        for(int i=0; i<size; ++i) par[i]=i;
    }
    int root(int x)
    {
        if (x==par[x]) return x;
        return par[x]=root(par[x]);
    }
    void unite(int x, int y)
    {
        x=root(x);
        y=root(y);
        if (x==y) return;
        if (rank[x]<rank[y]) {
            par[x]=y;
        }
        else {
            par[y]=x;
            if (rank[x]==rank[y]) ++rank[x];
        }
    }
    bool same(int x, int y)
    {
        return root(x)==root(y);
    }
};

int main()
{
    int n, m; cin>>n>>m;
    union_find_tree t(n);
    vector<int> boss(n), size(n, 1);
    for(int i=0; i<n; ++i) boss[i]=i;

    while (m--) {
        int a, b; cin>>a>>b;
        --a, --b;
        if (t.same(a, b)) continue;
        int bossA=boss[t.root(a)];
        int bossB=boss[t.root(b)];
        t.unite(a, b);
        int win, lose;
        if (size[bossA]==size[bossB]) {
            win=min(bossA, bossB);
            lose=max(bossA, bossB);
        }
        else {
            win=bossA, lose=bossB;
            if (size[bossA]<size[bossB]) swap(win, lose);
        }
        boss[t.root(a)]=win;
        size[win]+=size[lose];
        size[lose]=0;
    }
    for(int i=0; i<n; ++i) cout<<boss[t.root(i)]+1<<endl;
}