#include <fstream>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <set>
#include <cstring>
#include <map>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#define oo 2000000
#define MOD 1000000007
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int grad[50005], n, m,x,y;
vector<int>l[100005];
priority_queue<int, vector<int>, greater<int> > q;
void sorttop()
{
	for (int i = 1; i <= n; i++)
		if (grad[i] == 0)
			q.push(i);
	while (!q.empty())
	{
		int nod = q.top();
		fout << nod << " ";
		q.pop();
		for (auto next : l[nod])
		{
			grad[next]--;
			if (grad[next] == 0)
				q.push(next);
		}
	}
}
int main()
{
	fin >> n >> m;
	while (m--)
	{
		fin >> x >> y;
		l[x].push_back(y);
		grad[y]++;
	}
	sorttop();


}