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

using namespace std;

void dfs(vector< vector<int> > &v, vector<int>& viz, int nod, vector<int>& s)
{
	viz[nod] = 1;
	for (int i = 0; i < (int)v[nod].size(); i++)
		if (viz[v[nod][i]] != 1)
			dfs(v, viz, v[nod][i],s);
	s.push_back(nod);
}

int main()
{
	int n, m, i, j, nod1, nod2;
	ifstream f("sortaret.in");
	f >> n >> m;
	vector< vector<int> > v(n + 1);
	vector<int>viz(n + 1, 0);
	vector<int> s;
	for (i = 0; i < m; i++)
	{
		f >> nod1 >> nod2;
		v[nod1].insert(v[nod1].begin(), nod2);

	}
	for (i = 1; i <= n; i++)
	{
		for (j = 0; j < (int)v[i].size(); j++)
		{
			if (!viz[i])
				dfs(v, viz, v[i][j],s);
		}
	}
	ofstream g("sortaret.out");
	for (i = s.size()-1; i>=0; i--)
		g << s[i];
	f.close();
	g.close();
	return 0;
}