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

#define nmax 50001
#define mmax 100001

int N,M;
vector <int> V[nmax];
bitset <nmax> viz;

int search ()
{
	for (int i=1; i<=N; ++i)
		if (!viz[i]) return i;
	return 0;
}

void df (int i)
{
	for (int j=0; j<V[i].size(); ++j)
		if (!viz[V[i][j]]) df (V[i][j]);

	viz[i]=1;
	cout<<i<<' ';
}

int main ()
{
	freopen ("sortaret.in","r",stdin);
	freopen ("sortaret.out","w",stdout);

	cin>>N>>M;
	while (M--)
	{
		int a,b; cin>>a>>b;
		V[b].push_back(a);
	}
	
	int x=1;
	while (x)
	{
		df(x);
		x=search();
	}
	return 0;
}