#include <bits/stdc++.h>
#define MAXN 50010
using namespace std;
vector <int> ts,A[MAXN];
bool V[MAXN];
int n,m;

void topSort(int node){
	V[node]=1;
	for(int i=0;i<A[node].size();i++){
		if(!V[A[node][i]])topSort(A[node][i]);
	}
	ts.push_back(node);
}

int main(){
		ifstream cin("sortaret.in");
		ofstream cout("sortaret.out");
		cin>>n>>m;
		for(int i=0;i<m;i++){
			int a,b;
			cin>>a>>b;
			A[a].push_back(b);
		}
		for(int i=1;i<=n;i++)
		if(!V[i])topSort(i);
		for(int i=ts.size()-1;i>=0;i--)cout<<ts[i]<<' ';
	return 0;
}