#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

//ifstream fin("./date.txt");
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n, m,d[50001];
vector <int> v[50001],sol;

void read()
{
	fin >> n >> m;
	for (int i = 0; i < m; ++i)
	{
		int x, y;
		fin >> x >> y;
		v[x].push_back(y);
	}
}

void dfs(int node)
{
	d[node] = 1;
	for (int i = 0; i < v[node].size(); ++i)
	{
		int vecin = v[node][i];
		if (!d[vecin])
		{
			dfs(vecin);
		}
	}
	sol.push_back(node);
}

int main()
{
	read();
	for (int i = 1; i <= n; ++i)
	{
		if (!d[i])
		{
			dfs(i);
		}
	}
	for (int i = sol.size()-1; i > 0; --i)
		fout << sol[i] << " ";
}