#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int  viz[50005];
vector <int> graf[50005];

void dfs(int nod) {
	viz[nod] = 1;
	for (int i = 0; i < graf[nod].size(); i++) {
		int vecin = graf[nod][i];
		if (viz[vecin] == 0)
			dfs(vecin);
	}

	g << nod << ' ';
}
int main()
{
	int N, M;
	f >> N >> M;
	for (int i = 0; i < M; i++) {
		int x, y;
		f >> x >> y;
		graf[y].push_back(x);
	}

	for (int i = 1; i <= N; i++)
		if (viz[i] == 0)
			dfs(i);
	f.close();
	return 0;
}