#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <functional>
using namespace std;
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3f;
template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if (y > x) x = y; }

struct Node {
	bool visited;
	vector<int> adj;
};

Node V[100005];
list<int> top;
int N, M, ans;

void dfs(int index) {
	if (V[index].visited) return;
	V[index].visited = true;
	for (auto &i : V[index].adj) {
		dfs(i);
	}
	top.push_front(index);
}

int main() {
	freopen("sortaret.in", "r", stdin);
	freopen("sortaret.out", "w", stdout);
	cin >> N >> M;
	for (int i = 1; i <= M; i++) {
		int x, y; cin >> x >> y;
		V[x].adj.push_back(y);
	}
	for (int i = 1; i <= N; i++) {
		if (!V[i].visited) {
			dfs(i);
		}
	}
	for (auto &i : top) {
		cout << i << " ";
	}
	cout << endl;
}