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

ifstream fi ("sortaret.in");
ofstream fo ("sortaret.out");

const int DIM = 50005;
int N, M, viz[DIM];
vector <int> V[DIM];

void dfs (int n)
{
	fo << n << ' ';
	viz[n] = 1;
	for (int i = 0, f; i < (int)V[n].size(); i++)
	{
		f = V[n][i];
		if (!viz[f])
			dfs (f);
	}
}

int main ()
{
	fi >> N >> M;
	for (int i = 0, a, b; i < M; i++)
	{
		fi >> a >> b;
		V[a].push_back (b);		
	}
	
	for (int i = 1; i <= N; i++)
		if (!viz[i])
			dfs (i);
	
	return 0;
}