#include <fstream>
#include <vector>
using namespace std;
#define dim 100010
int grad[dim/2], coada[dim], sf, inc;
vector <int> v[dim];
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

void bfs()
{
	inc=1;
	while(inc<=sf)
	{
		int x=coada[inc];
		fout<<x <<" ";
		for(int k=0;k<v[x].size();++k)
		{
			--grad[v[x][k]];
			if(grad[v[x][k]]==0)
				coada[++sf]=v[x][k];
			
		}
		++inc;
	}
}

int main()
{
	
	int n, i, j, k,a , b,m;
	fin>>n >>m;
	
	for(i=1;i<=m;++i)
	{
		fin>>a >>b;
		v[a].push_back(b);
		++grad[b];
	}
	
	for(i=1;i<=n;++i)
		if(grad[i]==0)
			coada[++sf]=i;
		
	bfs();
	
	return 0;
}