#include <stdio.h>
#include <vector>
#include <queue>
#define NMAX 50005
#define pb push_back
using namespace std;
int n,m,sol[NMAX],r;
vector <int> A[NMAX];
bool viz[NMAX];
void dfs(int nod)
{
	viz[nod]=1; 
	int i,vec;
	for (i=0; i<A[nod].size(); i++)
	{
		vec=A[nod][i];
		if (!viz[vec])
			dfs(vec);
	}
	sol[++r]=nod;
}
int main()
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	scanf("%d%d",&n,&m);
	int i,x,y;
	for (i=1; i<=m; i++)
	{
		scanf("%d%d",&x,&y);
		A[x].pb(y);
	}
	for (i=1; i<=n; i++)
		if (!viz[i])
			dfs(i);
		
	for (i=n; i>=1; i--)
		printf("%d ",sol[i]);
	printf("\n");
	return 0;
}