#include<fstream>
#include<iostream>
#include<vector>
#include<bitset>
using namespace std;

#define MAXN 100050
bitset<MAXN> viz;
vector<int> g[MAXN];
vector<int> sol;
typedef vector<int>::iterator iter;
int nivel[MAXN];

void dfs(int nod)
{
	viz[nod] = 1;
	for(iter it = g[nod].begin(); it != g[nod].end(); it++)
		if(!viz[*it])
			dfs(*it);
	sol.push_back(nod);
}

int main()
{
	ifstream in("sortaret.in");
	ofstream out("sortaret.out");
	
	int n, m;
	in >> n >> m;
	
	for (int i = 1; i <= m; ++i) {
		int x, y;
		in >> x >> y;
		g[x].push_back(y);
	}
	int nr = 0;
	for(int i = 1; i <= n; i++)
	{
		if(!viz[i])
		{
			dfs(i);
		}
	}
	for(iter it = sol.end(); it != sol.begin(); it--)
		out << *it << ' ';
}