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

vector<int> v[50001];
vector<int> q;
int viz[50001];

void dfs(int nod)
{
	viz[nod] = 1;
	for (int i = 0; i < v[nod].size(); i++)
		if (viz[v[nod][i]] == 0)
			dfs(v[nod][i]);
	q.push_back(nod);
}

int main()
{
	ifstream cin("sortaret.in");
	ofstream cout("sortaret.out");
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= m; i++)
	{
		int x, y;
		cin >> x >> y;
		v[x].push_back(y);
	}
	for (int i = 1; i <= n; i++)
		if (viz[i] == 0)
			dfs(i);
	for (int i = q.size() - 1; i >= 0; i--)
		cout << q[i] << ' ';
	return 0;
}