#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

const int  NMAX = 100001;
vector<int> graf[NMAX];
bool vizitat[NMAX];
vector<int> sortat;

void DFS(int x) {
	vizitat[x] = true;

	for (int i = 0; i < graf[x].size(); i++) {
		if (!vizitat[graf[x][i]]) {
			DFS(graf[x][i]);
		}
	}
	sortat.push_back(x);
}

int main() {
	ifstream in("sortaret.in");
	ofstream out("sortaret.out");
	int n, m, x, y;
	in >> n >> m;

	for (int i = 0; i < m; i++) {
		in >> x >> y;
		graf[x].push_back(y);
	}

	for (int i = 1; i <= n; i++) {
		if (!vizitat[i]) {
			DFS(i);
		}
	}
	for (int i = n-1; i >= 0; i--) {
		out << sortat[i] << " ";
	}

	return 0;
}