#include <cstdio>
#include <vector>
#include <stack>

using namespace std;

const int NMAX = 50002;

vector <int> G[NMAX];

int viz[NMAX];

stack <int> q;

void dfs(int u){
	viz[u]=1;
	for(int i=0;i<G[u].size();++i){
		int v=G[u][i];
		if(viz[v]==0)
			dfs(v);
	}
	q.push(u);
}

int main(){
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);

	int n,m,u,v;

	scanf("%d%d",&n,&m);

	for(int i=1;i<=m;++i){
		scanf("%d%d",&u,&v);
		G[u].push_back(v);
	}

	for(int i=1;i<=n;++i)
		if(!viz[i])
			dfs(i);

	while(!q.empty())
		printf("%d ",q.top()),q.pop();
	

	return 0;
}