#include<stdio.h>
#include<string.h>
#include<vector>
#include<algorithm>


using namespace std;

int nr,x,y,i,m,n;
bool ok[1000001];
vector <int> a[100001],b;
vector <int>::iterator k;


void dfs(int q)
{
	vector <int>::iterator it;
	
	ok[q]=true;
	for (it=a[q].begin();it!=a[q].end();it++)
		if(!ok[*it]) dfs(*it);
	b.push_back(q);
}

int main()

{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	
	scanf("%d%d",&n,&m);
	
	for (i=1;i<=m;i++)
	{
		scanf("%d%d",&x,&y);
		a[x].push_back(y);
	}
	
	memset(ok,false,sizeof(bool));
	
	for (i=1;i<=n;i++)
	{
		if (ok[i]==false)
			dfs(i);
	}
	reverse(b.begin(),b.end());
	
	for (k=b.begin();k!=b.end();k++)
		printf("%d ",*k);
	
	printf("\n");
	
	return 0;
}