#include<stdio.h>
#include <vector>
#include <queue>
#define NMax 10001

using namespace std;

vector<long> li[NMax]; 
queue<long> coada;

long nr,n,m,i,x,y,viz[NMax];

void topsort()
{
	
	while(!coada.empty())
	{
		x=coada.front();
		printf("%ld ",x);
		nr=li[x].size();
		
		for (i=0;i<nr;i++) 
		{
			viz[li[x][i]]--;
			if(viz[li[x][i]]==0)
				coada.push(li[x][i]);
		}
		coada.pop();
	}
}

int main()
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	
	scanf("%ld %ld",&n,&m);
	
	for(i=1;i<=m;i++)
	{
		scanf("%ld %ld",&x,&y);
		li[x].push_back(y);
		viz[y]++;
	}
	
	for(i=1;i<=n;i++)
		if(viz[i]==0) 
			coada.push(i);
	
	topsort();

	return 0;
}