#include <iostream>
#include <vector>
#include <fstream> 
#include <algorithm>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

void dfs(int node, vector<int>& ans, vector<vector<int>>& edges, vector<bool>& viz) {
	viz[node] = true;
	
	for (int j = 0; j < edges[node].size(); j++) {
		int next = edges[node][j];
		if (!viz[next]) {
			dfs(next, ans, edges, viz);
		}
	}
	ans.push_back(node + 1);
}

int main() {

	int n, m; 
	fin >> n >> m;

	vector<vector<int>> edges(n);
	vector<bool> viz(n);
	vector<int> ans;

	for (int i = 0; i < m; i++) {
		int a, b; 
		fin >> a >> b; a--; b--;

		edges[a].push_back(b);
	}

	for (int node = 0; node < n; node++) {
		if (!viz[node]) {
			dfs(node, ans, edges, viz);
		}
	}

	reverse(ans.begin(), ans.end());
	for (int i = 0; i < n; i++) {
		fout << ans[i] << " ";
	}
	fout << "\n";

	return 0;
}