#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef set<int> si;
const int inf = 1e9;
const int mod = 1e9+7;

int a[10005], b[10005];
int find(int a1){
  if(a1 == a[a1]) return a1;
  a[a1] = find(a[a1]);
  return a[a1];
}
void merge(int a1, int a2){
  int f1 = find(a1), f2 = find(a2);
  if(f1 == f2) return;
  if(f1 > f2)swap(f1, f2);
  if(b[f1] < b[f2])swap(f1, f2);
  b[f1] += b[f2];
  b[f2] = 0;
  a[f2] = f1;
  return;
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, m;
  cin >> n  >> m;
  FOR(i, 1, n + 1){
    a[i] = i;
    b[i] = 1;
  }
  FOR(i, 0, m){
    int c, d;
    cin >> c >> d;
    merge(c, d);
  }
  FOR(i, 1, n + 1){
    cout << find(i) << endl;
  }
}