#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
#define nmax 50004
vector<int> v[nmax];
bool used[nmax];
struct pereche {
	int nr, frecv;
};
pereche viz[nmax];
int cate;
void dfs(int i) {
	used[i] = 1;
	for (auto elem : v[i]) {
		if (used[elem] == 0) {
			dfs(elem);
		}
	}
	cate++;
	viz[i].frecv = cate;
}

int main() {
	int n, m,x,y;
	f >> n;
	f >> m;
	for (int i = 1; i <= n; i++) {
		viz[i].frecv = 0;
		viz[i].nr = i;
	}
	for (int i = 1; i <= m; i++) {
		f >> x >> y;
		v[x].push_back(y);
	}
	for (int i = 1; i <= n; i++) {
		if (used[i] == 0)
			dfs(i);
	}
	sort(viz + 1, viz + n + 1, [](pereche a,pereche b) {
		return a.frecv > b.frecv;
	});
	for (int i = 1; i <= n; i++) {
		g << viz[i].nr << " ";
	}

}