// #include <iostream>

#include <fstream>
#include <vector>
#include <queue>

using namespace std;

 ifstream cin("sortaret.in");
 ofstream cout("sortaret.out");

 const int NMAX = 50000;
 const int MMAX = 100000;
 vector<int>g[NMAX + 1];
 deque<int>sol;
 vector<int>in(NMAX + 1);
 int n, m;

int main()
{
	cin >> n >> m;

	for (int i = 0; i < m; i++)
	{
		int x, y;
		cin >> x >> y;
		g[x].push_back(y);
		in[y]++;
	}

	deque<int>q;
	for (int i = 1; i <= n; i++)
		if (!in[i])
			q.push_back(i);

	while(!q.empty())
	{
		int p = q.front();
		q.pop_front();
		cout << p << " ";
		for (auto x : g[p])
		{
			in[x]--;
			if (!in[x])
				q.push_back(x);
		}
	}
	return 0;
}