#include <fstream>
#include <iostream>
#include <vector>
#include <stack>
#include <string.h>

using namespace std;

typedef vector<vector<int> > Graph;

#define MAXN 50005

int visited[MAXN];
stack<int> sorted;

void TopSort(const Graph& graph, const int node)
{
	visited[node] = 1;
	for (int i=0; i<graph[node].size(); ++i)
	{
		if (!visited[graph[node][i]])
		{
			TopSort(graph, graph[node][i]);
		}
	}
	
	sorted.push(node);
}

int main()
{
	int n, m;
	fstream fin("sortaret.in", fstream::in);
	fstream fout("sortaret.out", fstream::out);
	Graph graph;
	
	fin >> n >> m;
	
	graph.resize(n);
	
	for (int i=0; i<m; ++i)
	{
		int x, y;
		fin >> x >> y;

		graph[x-1].push_back(y-1);
	}
	
	for (int i=0; i<n; ++i)
	{
		if (!visited[i])
		{
			TopSort(graph, i);
		}
	}

	for (int i=0; i<n; ++i)
	{
		fout << sorted.top()+1 << " ";
		sorted.pop();
	}
	fout << endl;
	
	return 0;
}