#include<stdio.h>
#include <queue>
#include <vector>
using namespace std;

int n,m,ext[100001];
const int N=1000001;
vector<int> a[N];
queue<int> q;

void citire()
{
	int x,y,i;
	scanf("%d %d",&n,&m);
	for(i=1;i<=m;i++)
	{
		scanf("%d %d",&x,&y);
		a[x].push_back(y);
		ext[y]++;
	}
}
	

int main()
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	citire();
	for(int i=1 ; i<=n ; i++)
		if(ext[i] == 0)
			q.push(i);
	int x,y;
	while(!q.empty())
	{
		x = q.front();
		printf("%d ",x);
		q.pop();
		for(size_t i=0 ; i<a[x].size() ; i++)
		{
			y=a[x][i];
			ext[y]--;
			if(ext[y]==0) q.push(y);
			
		}
	}
}