#include <fstream>
#include <vector>
using namespace std;

ifstream in("sortaret.in");
ofstream out("sortaret.out");

const int N=100005;
vector <int> a[N];
int need[N];

void dfs(int x)
{
	need[x]--;
	out<<x<<" ";
	for(vector <int> :: iterator i=a[x].begin();i!=a[x].end();i++)
	{
		need[*i]--;
		if(!need[*i])
			dfs(*i);
	}
}

int main()
{
	int n,m,x,y;
	in>>n>>m;
	while(m--)
	{
		in>>x>>y;
		a[x].push_back(y);
		need[y]++;
	}
	for(int i=1;i<=n;i++)
		if(!need[i])
			dfs(i);
	return 0;
}