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

int n,m;
vector <int> V[50010];
set <pair<int,int> > Sol;
bool u[50010];

void dfs(int q, int t){
	u[q]=true;
	Sol.insert(make_pair(t,q));
	for (int i=0; i<V[q].size(); i++){
		if (!u[V[q][i]]) dfs(V[q][i],t+1);
	}
}

int main(){
	ifstream cin ("sortaret.in");
	ofstream cout ("sortaret.out");
	cin>>n>>m;
	for (int i=1; i<=m; i++){
		int x,y;
		cin>>x>>y;
		V[x].pb(y);
	}
	for (int i=1; i<=n; i++){
		if (!u[i]) dfs(i,1);
	}
	for (auto it:Sol){
		cout<<it.second<<" ";
	}
	return 0;
}