#include<cstdio>
#include<vector>
using namespace std;
#define maxn 50005
#define maxm 100005
FILE *f=fopen("sortaret.in","r");
FILE *g=fopen("sortaret.out","w");
vector <int> sortare,viz(maxn),G[maxm];
int x,y,m,n;
void dfs(int nod){
	viz[nod]=1;
	for(int i=0;i<G[nod].size();i++)
		if(viz[G[nod][i]]==0)
			dfs(G[nod][i]);
	sortare.push_back(nod);
	
}
int main (){
	fscanf(f,"%d%d",&n,&m);
	for(int i=1;i<=m;i++){
		fscanf(f,"%d%d",&x,&y);
		G[x].push_back(y);
	}
	for(int i=1;i<=n;i++)
		if(viz[i]==0)
			dfs(i);
	for(int i=sortare.size()-1;i>=0;i--)
		fprintf(g,"%d ",sortare[i]);
	return 0;
}