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

void dfs(int x)
{
	viz[x] = 1;
	for (int i = 0; i < graf[x].size(); i++)
    {
		int vecin = graf[x][i];
		if (viz[vecin] == 0)
			dfs(vecin);
	}
	fout << x << " ";
}
int main()
{
	int n, m;
	fin >> n >> m;
	for (int i = 0; i < m; i++)
    {
		int x, y;
		fin >> x >> y;
		graf[y].push_back(x);
	}

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