#include<bits/stdc++.h>
using namespace std;  
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define rep(i,n) for(ll i=0;i<(n);i++)  
#define pii pair<int,int>
#define piii pair<int,pii>
#define mp make_pair
#define pb push_back  
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second  
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-5;
const double PI = M_PI;  
#define DEB cout<<"!"<<endl
#define SHOW(a,b) cout<<(a)<<" "<<(b)<<endl
#define SHOWARRAY(ar,i,j) REP(a,i)REP(b,j)cout<<ar[a][b]<<((b==j-1)?((a==i-1)?("\n\n"):("\n")):(" "))
  
#define DIV 1000000007
typedef vector<ll> Array;
typedef vector<Array> matrix;

typedef tuple<int,int,int> tiii;
#define mt make_tuple

#define Nodes 10000
class UF{
public:
  int value[Nodes];
  int over[Nodes]; // When over < 0, 'over' keep elements of node(using negative number). -1 means this tree is a node.
  int root(int index){
    int t = index;
    while(over[t] >= 0)
      t = over[t];
    if(index!=t)over[index] = t;
    return t;
  }
  int merge(int a,int b){
    if(this->root(a) == this->root(b)) return false;
    over[root(a)] += over[root(b)];
    over[root(b)] = root(a);
  }
  UF(){rep(i,Nodes) over[i] = -1;}
};

int main(){
  UF u;
  rep(i,Nodes)
    u.value[i] = i;
  
  int n,m; cin >> n >> m;

  rep(i,m){
    int a,b; cin >> a >> b;
    a--; b--;
    if(u.root(a) == u.root(b))  continue;
    int a_root = u.root(a); int b_root = u.root(b);
    if(u.over[a_root] < u.over[b_root])
      u.merge(a_root,b_root);
    else if(u.over[a_root] > u.over[b_root])
      u.merge(b_root,a_root);
    else if(a_root < b_root)
      u.merge(a_root,b_root);
    else
      u.merge(b_root,a_root);
  }

  rep(i,n)
    cout << u.root(i)+1 << endl;
}