#include<iostream>
#include<vector>
#include<fstream>
#include<queue>

using namespace std;

vector <int> g[50005];
int grad[50005];
queue <int> q;

int main()
{
	int m, n, i, a, b, x;
	ifstream f("sortaret.in");
	ofstream out("sortaret.out");
	f>>n;
	f>>m;
	for(i=0;i<m;i++)
	{
		f>>a>>b;
		g[a].push_back(b);
		grad[b]++;
	}
	for(i=1;i<=n;i++)
		if(grad[i]==0)
			q.push(i);

	for(i=0;i<n;i++)
	{
		x=q.front();
		for (unsigned j=0; j < g[x].size(); j++) 
		{
			grad[g[x][j]]--;
			if(grad[g[x][j]]==0)
				q.push(g[x][j]);
		}
		out<<q.front()<<" ";
		q.pop();
	}
	return 0;
}