#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <map>
#include <stack>
using namespace std;

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

int N, M;
map<int, vector<int>> G;
map<int, bool> visited;
stack<int> result;

void Read()
{
	fin >> N >> M;
	for (int i = 0; i < M; i++)
	{
		int x, y;
		fin >> x >> y;
		G[x].push_back(y);
	}
}

void DFS(int node)
{
	visited[node] = true;
	for (auto child : G[node])
		if (!visited[child])
			DFS(child);
	result.push(node);
}

int main()
{
	Read();

	for (int i = 1; i <= N; i++)
		if (!visited[i])
			DFS(i);

	while (!result.empty())
	{
		fout << result.top() << " ";
		result.pop();
	}

	return 0;
}