#include <cstdio>
#include <iostream>
#include <vector>
#define NMAX 50010
using namespace std;

vector<int> v[NMAX], sol;
int poz, viz[NMAX], N, M, i, ord[NMAX];

void iFu(void)
{
	int x, y;
	FILE *f = fopen("sortaret.in", "r");
	fscanf(f, "%d%d", &N, &M);
	for(i = 1; i <= M; ++i)
		fscanf(f, "%d%d", &x, &y), v[x].push_back(y);
	
	fclose(f);
}
void DFS(int nod)
{
	//cout <<nod <<' ' <<endl;
	viz[nod] = 1;
	vector<int>::iterator it;
	
	//for(it = v[nod].begin(); it != v[nod].end(); ++it)
		//if(!viz[ *it ])
	for(int i = 0; i < v[nod].size(); i++)
	{
		//cout <<' ' <<i <<endl;
		//if(!viz[ *it ]){
		if(!viz[v[nod][i]]){
			DFS( v[nod][i] );
			//DFS(*it);
		}
		
	}
	
	sol.push_back(nod);
	//ord[++poz] = nod;
}
void solve(void)
{
	for(i = 1; i <= N; ++i)
		if(!viz[i])
			DFS(i);
}
void oFu(void)
{
	FILE *g = fopen("sortaret.out", "w");
	reverse(sol.begin(), sol.end());
	for(i = 0; i < N; ++i)
		fprintf(g, "%d ", sol[i]);
	//for(i = N; i > 0; --i)
		//fprintf(g, "%d ", ord[i]);
	fclose(g);
}

int main(void)
{
	iFu();
	solve();
	oFu();
	
	return 0;
}