#include<cstdio>
#include<vector>
#define pb push_back
#define Nmax 50001
using namespace std;
int N,M,i,x,y;
vector<int> grad(Nmax,0),a[Nmax],sol,ok(Nmax,0);

void DF(int nod)
{
	ok[nod]=1;
	for (vector<int>::iterator it=a[nod].begin();it!=a[nod].end();it++)
		if (!ok[*it]) DF(*it);
	sol.pb(nod);
}
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);
		grad[y]++;
	}
	for (i=1;i<=N;i++)
		if (!ok[i] && !grad[i]) DF(i);
	for (i=N-1;i>=0;i--)
		printf("%d ",sol[i]);
}