#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <list>
#define nmax 100001

using namespace std;

ifstream in("sortaret.in");
ofstream out("sortaret.out");
int n, m;
int T[nmax];
bool vizitat[nmax];
vector<int>LA[nmax];
list<int>listatop;
void citirelistead()
{
	in >> n >> m;
	for (int i = 1; i <= m; ++i)
	{
		int x, y;
		in >> x >> y;
		LA[x].push_back(y);
	}
	for (int i = 0; i < n; ++i)
		sort(LA[i].begin(), LA[i].end());
}
void dfs(int x, list<int>& lista)
{
	vizitat[x] = true;
	for(int i=0;i<LA[x].size();++i)
			if (!vizitat[i])
			{
				vizitat[i] = true;
				dfs(i, lista);
			}
	listatop.push_front(x);
}
void afisarelist(list<int>lst)
{
	list<int>::iterator it;
	int v[nmax];
	int i = 1;
	for (it = lst.begin(); it != lst.end(); ++it)
	{
		v[i] = *it;
		++i;
	}
	for (int i = n; i > 0; --i)
		out << v[i] << ' ';
	
}
int main()
{
	citirelistead();
	fill(vizitat, vizitat + n + 1, false);
	for (int x = 1; x <= n; ++x)
		if (!vizitat[x])
			dfs(x, listatop);
	afisarelist(listatop);
}