#include <stdio.h>
#include <vector>
#include <queue>
#define NMAX 50005
#define pb push_back
using namespace std;
int n,m,dep[NMAX];
vector <int> A[NMAX];
queue <int> Q;
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); dep[y]++;
	}
	for (i=1; i<=n; i++)
		if (!dep[i])
			Q.push(i);
	while (!Q.empty())
	{
		x=Q.front();
		printf("%d ",x);
		Q.pop();
		for (i=0; i<A[x].size(); i++)
		{
			y=A[x][i]; dep[y]--;
			if (!dep[y])
				Q.push(y);
		}
	}
	printf("\n");
	return 0;
}