#include <iostream>
#include <stdio.h>
#include <cstring>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <utility>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define LL long long
#define INF 100000000
#define mod 1000000007
using namespace std;
int keta(int n,int k){return (n/int(pow(10,double(k-1)))) % 10;} //nの下からk桁目
ll gcd(ll n,ll m){
	if(n<m){ll a=m;m=n;n=a;}
	ll r=n%m;
	while(r!=0){
		n=m;
		m=r;
		r=n%m;
	}
	return m;
}
ll lcm(ll n,ll m){
	return n*m/gcd(n,m);
}

int main(){
	int n,m;
	cin>>n>>m;
	vector<int> a(m),b(m),x(n),y(n);
	rep(i,m){
		cin>>a[i]>>b[i];
		a[i]--;b[i]--;
	}
	rep(i,n){
		x[i]=i;
		y[i]=1;
	}
	rep(i,m){
		if(y[x[a[i]]]>y[x[b[i]]]){ //a[i]の勝ち
			y[x[a[i]]]+=y[x[b[i]]];
			int boss=x[b[i]];
			rep(j,n){
				if(x[j]==boss){
					x[j]=x[a[i]];
				}
			}
			//cout<<a[i]<<" "<<b[i]<<" a"<<endl;
		}else if(y[x[a[i]]]<y[x[b[i]]]){ //b[i]の勝ち
			y[x[b[i]]]+=y[x[a[i]]];
			int boss=x[a[i]];
			rep(j,n){
				if(x[j]==boss){
					x[j]=x[b[i]];
				}
			}
			//cout<<a[i]<<" "<<b[i]<<" b"<<endl;
		}else if(x[a[i]]<x[b[i]]){
			y[x[a[i]]]+=y[x[b[i]]];
			int boss=x[b[i]];
			rep(j,n){
				if(x[j]==boss){
					x[j]=x[a[i]];
				}
			}
			//cout<<a[i]<<" "<<b[i]<<" a"<<endl;
		}else if(x[a[i]]>x[b[i]]){
			y[x[b[i]]]+=y[x[a[i]]];
			int boss=x[a[i]];
			rep(j,n){
				if(x[j]==boss){
					x[j]=x[b[i]];
				}
			}
			//cout<<a[i]<<" "<<b[i]<<" b"<<endl;
		}else{
		}
		/*rep(i,n){
			printf("%d\n",x[i]);
		}
		cout<<endl;*/
	}
	rep(i,n){
		printf("%d\n",x[i]+1);
	}


			

}