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

using namespace std;

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

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

			dfs(edges, viz, next);
		}
	}
}

int main() {

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

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

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

		edges[a].push_back(b);
	}

	for (int i = 0; i < n; i++) {
		if (!viz[i]) {
			viz[i] = true;
			cout << i + 1 << " ";
			
			dfs(edges, viz, i);
		}
	}


	return 0;
}