#include<fstream>
#include<vector>
const int max_n=50005;

using namespace std;



int n, m, i, x, y, viz[max_n], coada[max_n], nr[max_n], nrm;
vector<int> v[max_n];
void df(int nod){
	
	viz[nod] = 1;
	for (int i = 0; i < nr[nod]; i ++)
		if (!viz[v[nod][i]])
			df(v[nod][i]);
	
	coada[++nrm] = nod;
}
int main()
{
	ifstream f("sortaret.in");
	ofstream g("sortaret.out");
	
	f>>n>>m;
	
	for (i = 1; i <= m; i ++){
		f>>x>>y;
		
		nr[x] ++;
		v[x].push_back(y);
	}
	
	for (i = 1; i <= n; i ++)
		if (!viz[i])
			df(i);
	
	for (i = n; i; i --)
		g<<coada[i]<<" ";
	g<<"\n";
	
	return 0;
}