#include<fstream>
#include<vector>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");

vector<int> v[50010];
int viz[50010];
vector<int> stack;
void DFS(int x)
{
	for (int i = 0;i < v[x].size();++i)
		if (!viz[v[x][i]])
			DFS(v[x][i]),viz[v[x][i]]=1;

	stack.push_back(x);
}
int main()
{
	int N, M,a,b;
	in >> N >> M;
	for (int i = 1;i <= M;++i)
	{
		in >> a >> b;
		v[a].push_back(b);
	}
	for (int i = 1;i <= N;++i)
		if (!viz[i])
		{
			viz[i] = 1;
			DFS(i);
		}
	for (int i = stack.size() - 1;i >= 0;--i)
		out << stack[i] << " ";
	return 0;
}