#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <stack>
#define nmax 100001

using namespace std;

ifstream in("sortaret.in");
ofstream out("sortaret.out");
int n, m;
int T[nmax], info[nmax];
deque<int>LA[nmax];
stack<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 = 1; i <= n; ++i)
		sort(LA[i].begin(), LA[i].end());
}
void dfs(int x,stack<int>&lista)
{
	info[x] = true;
	for (int i = 0; i < LA[x].size(); ++i)
	{
		int vecin = LA[x][i];
		if (!info[vecin])
		{
			T[vecin] = x;
			dfs(vecin,lista);
		}
	}
	listatop.push(x);
}
void afisarelist(stack<int>lst)
{
	for (int i = 0; i < n; ++i)
	{
		out << lst.top() << " ";
		lst.pop();
	}
}
int main()
{
	citirelistead();
	fill(info, info + n + 1, false);
	for (int x = 1; x <= n; ++x)
		if (!info[x])
			dfs(x,listatop);
	afisarelist(listatop);
}