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

int n,m;
vector <int> g[NMAX];
bool gradInt[NMAX],viz[NMAX];
int k,sol[NMAX];

void read()
{
	int i,x,y;

	ifstream fin("sortaret.in");

	fin>>n>>m;
	for (i=1; i<=m; ++i)
	{
		fin>>x>>y;
		g[x].push_back(y);
		gradInt[y] = 1;
	}

	fin.close();
}

void parcurgere(int nod)
{
	int i;

	viz[nod] = 1;

	for (i=0; i<(int)g[nod].size(); ++i)
		if (viz[g[nod][i]] == 0)
			parcurgere(g[nod][i]);

	sol[++k] = nod;
}

void write()
{
	int i;

	ofstream fout("sortaret.out");

	for (i=n; i>=1; --i)
		fout<<sol[i]<<" ";
	fout<<'\n';

	fout.close();
}

int main()
{
	int i;

	read();

	for (i=1; i<=n; ++i)
		if (gradInt[i] == 0)
			parcurgere(i);

	write();

	return 0;
}