#include <iostream>
#include<fstream>
#include<vector>
using namespace std;
vector<int>graf[50005];
int viz[50005];
int N, M;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
void DFS(int nod)
{
	viz[nod] = 1;
	int l = graf[nod].size();
	for (int i = 0; i < l; i++)
		if (viz[graf[nod][i]] != 1) DFS(graf[nod][i]);
	fout << nod<<" ";
}
int main()
{
	fin >> N >> M;
	int a, b;
	for (int i = 0; i < M; i++)
	{
		fin >> a >> b;
		graf[b].push_back(a);
	}
	for (int i = 1; i <= N; i++)
		if (!viz[i]) DFS(i);
}