#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n, m;
bool viz[50001];
vector <int> adiacenta[50001];
stack<int> rasp;
void DFS(int curent)
{
	for (auto x : adiacenta[curent])
	{
		if (!viz[x])
		{
			viz[x] = 1;
			DFS(x);
		}
	}
	rasp.push(curent);
}
int main()
{
	f >> n >> m;
	for (int i = 1; i <= m; i++)
	{
		int nr1, nr2;
		f >> nr1 >> nr2;
		adiacenta[nr1].push_back(nr2);
	}
	for (int i = 1; i <= n; i++)
	{
		if (!viz[i])
		{
			viz[i] = 1;
			DFS(i);
		}
	}
	while (!rasp.empty())
	{
		g << rasp.top()<< " ";
		rasp.pop();
	}
}