#include<fstream>
#include<vector>
#include<cstring>
#include <stack>
#define NMAX 100001
using namespace std;

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

void DFS(vector<int>G[], int nod, int viz[], stack<int>& s) {
	viz[nod] = 1;
	for (int i = 0; i < G[nod].size(); ++i) {
		if (viz[G[nod][i]] == 0) {
			DFS(G, G[nod][i], viz, s);
		}
	}
	s.push(nod);

}

int main()
{
	int n, m, x, y, nod, viz[NMAX];
	vector<int>G[NMAX];
	stack<int>s;
	f >> n >> m;
	for (int i = 0; i < m; ++i) {
		f >> x >> y;
		G[x].push_back(y);
	}
	memset(viz, 0, sizeof(viz));
	for (int i = 1; i <= n; ++i) {
		if (viz[i] == 0) {
			DFS(G, i, viz, s);
		}
	}
	for(int i = 0; i < n; ++i) {
		g << s.top() << " ";
		s.pop();
	}
	return 0;
}