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

using namespace std;

const int Nmax = 50001;
vector <int> G[Nmax];
stack <int> S;
int n, m, viz[Nmax];

void citire() {
	int i, x, y;
	ifstream f("sortaret.in");
	f >> n >> m;
	for (i = 0; i < m; ++i) {
		f >> x >> y;
		G[x].push_back(y);
	}
	f.close();
}

void dfs(int s) {
	int i;
	viz[s] = 1;
	for (i = 0; i < G[s].size(); ++i) {
		if (!viz[G[s][i]])
			dfs(G[s][i]);
	}
	S.push(s);
}

int main() {
	ofstream g("sortaret.out");
	citire();
	dfs(1);
	while (!S.empty()) {
		g << S.top() << " ";
		S.pop();
	}
	for (int i = 1; i <= n; ++i) {
		if (!viz[i])
			g << i << " ";
	}
	return 0;
}