#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
#define NMAX 50005
#define MMAX 100005
using namespace std;

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

int n, m;
vector <int> muchii[NMAX], order;
bitset <NMAX> checked;

void dfs (int node) {
	checked[node] = 1;
	for (int i = 0; i < muchii[node].size(); ++i) {
		if (!checked[muchii[node][i]]) {
			dfs(muchii[node][i]);
		}
	}
	order.push_back(node);
}

int main ()
{
	fin >> n >> m;
	int x, y;
	for (int i = 1; i <= m; ++i) {
		fin >> x >> y;
		muchii[x].push_back(y);
	}
	for (int i = 1; i <= n; ++i) {
		if (!checked[i]) {
			dfs(i);
		}
	}
	for (int i = order.size() - 1; i >= 0; --i) {
		fout << order[i] << " ";
	}
	
	fin.close();
	fout.close();
	return 0;
}