#include <bits/stdc++.h>
using namespace std;

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

int n, m;
vector<int> edge[100001];
vector<int> ord;
bitset<100001> viz;

void dfs(int x)
{
	viz[x] = 1;
	for (int i : edge[x])
		if (!viz[i])
			dfs(i);
	ord.push_back(x);
}

int main()
{
	int x, y;
	fin >> n >> m;
	while (m--)
	{
		fin >> x >> y;
		edge[x].push_back(y);
	}
	for (int i = 1; i <= n; i++)
		if (!viz[i])
			dfs(i);
	reverse(ord.begin(), ord.end());
	for (int i : ord)
		fout << i << " ";
	fout << "\n";
	fin.close();
	fout.close();
	return 0;
}