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

#define NMax 50010

using namespace std;

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

int nodes, edges, n1, n2, grext[NMax], sol[NMax];
vector<int> G[NMax];
queue<int> QU;

int main()
{
	f >> nodes >> edges;

	int cop = nodes;

	for (int i = 1; i <= edges; i++) {
		f >> n1 >> n2;

		G[n1].push_back(n2);
		grext[n2]++;
	}

	for (int i = 1; i <= nodes; i++)
		if (grext[i] == 0)
			QU.push(i);

	while (!QU.empty()) {

		for (vector<int>::iterator it = G[QU.front()].begin(); it != G[QU.front()].end(); it++) {
			grext[*it]--;

			if (grext[*it] == 0)
				QU.push(*it);
		}

		sol[nodes--] = QU.front();
		QU.pop();

	}

	for (int i = cop; i >= 1; i--)
		g << sol[i]<<" ";

}