#include <stdio.h>
#include <vector>
#include <queue>
#define NMAX 50001
using namespace std;
int n,m,A[NMAX];
vector <int> v[NMAX];
void read()
{
	scanf("%d%d",&n,&m);
	int i,x,y;
	for (i=1; i<=m; i++)
	{
		scanf("%d%d",&x,&y);
		v[x].push_back(y);
		A[y]++;
	}
}
void solve()
{
	int i,j,x,vec;
	queue <int> Q;
	for (i=1; i<=n; i++)
		if (!A[i])
			Q.push(i);
	while (!Q.empty())
	{
		x=Q.front();
		printf("%d ",x);
		Q.pop();
		for (i=0; i<v[x].size(); i++)
		{
			vec=v[x][i];
			A[vec]--;
			if (!A[vec])
				Q.push(vec);
		}
	}
}
int main()
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	read();
	solve();
	return 0;
}