#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");

int const maxim = 50005;
int n, m, tata;
bool vizitat[maxim] = { false };
vector<int> stocare[maxim];
stack<int> stiva;

void citire() {
	in >> n >> m;
	for (int i = 1; i <= m; i++) {
		int a, b;
		in >> a >> b;
		stocare[a].push_back(b);
	}
}


void dfs(int nod) {
	vizitat[nod] = true;
	for (size_t i = 0; i < stocare[nod].size(); i++) {
		int vecin = stocare[nod][i];
		if (vizitat[vecin] == false) {
			dfs(vecin);
		}
	}
	stiva.push(nod);
}

int main() {
	citire();
	for (int i = 1; i <= n; i++) {
		if (vizitat[i] == false) {
			dfs(i);
		}
	}
	while (!stiva.empty()) {
		out << stiva.top() << " ";
		stiva.pop();
	}

	return 0;
}