#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>


typedef std::vector<int>::iterator iter;
typedef std::vector<int>::reverse_iterator riter;


const int MAXN = 50005;
std::ifstream f("sortaret.in");
std::ofstream g("sortaret.out");
int n, m;
std::vector<int> G[MAXN];
std::bitset<MAXN> viz;
std::vector<int> sol;


void topo(int node)
{
	viz[node] = true;
	for (iter it = G[node].begin(); it != G[node].end(); it++) {
		if (viz[*it] == true) {
			continue;
		}
		topo(*it);
	}
	sol.push_back(node);
}


int main()
{
	f >> n >> m;
	for (int i = 1, x, y; i <= m; i++) {
		f >> x >> y;
		G[x].push_back(y);
	}


	for (int i = 1; i <= n; i++) {
		if (viz[i] == false) {
			topo(i);
		}
	}

	for (riter it = sol.rbegin(); it != sol.rend(); it++) {
		g << *it << ' ';
	}
	g << std::endl;


	f.close();
	g.close();
	return 0;
}