#include <fstream>
#include <queue>
#include <vector>
#include <bitset>
#define maxn 50010

using namespace std;

bitset<maxn> seen;
queue<int> Q;
vector<int> a[maxn];

int n, m;

void dfs(int node)
{
	seen[node] = true;
	for (int i = 0; i < a[node].size(); i++)
		if (seen[a[node][i]] == false)
			dfs(a[node][i]);

	Q.push(node);
}

int main()
{
	ifstream in("sortaret.in");
	ofstream out("sortaret.out");

	in >> n >> m;
	int x, y;

	for (int i = 0; i < m; i++)
	{
		in >> x >> y;
		a[x].push_back(y);
	}

	for (int i = 1; i < n; i++)
	{
		if (seen[i] == false)
			dfs(i);
	}

	while (!Q.empty())
	{
		out << Q.front() << " ";
		Q.pop();
	}

	return 0;
}