#include <fstream>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;

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

vector <int> v[50001];
int gi[50001], vsort[50001];
queue <int> q;

void topsort (int n)
{
	int i, j, x;
	for (i = 1; i<=n; i++)
		if (gi[i] == 0)
			q.push(i);
	
	for (i = 1; i<=n; i++)
	{
		x = q.front();
		q.pop();
		
		vsort[i] = x;
		for (j = 0; j<v[x].size(); j++)
		{
			gi[v[x][j]]--;
			if (gi[v[x][j]] == 0)
				q.push(v[x][j]);
		}
	}
}

int main()
{
	int n, m, i, x, y;
	fin >> n >> m;
	for (i = 1; i<=m; i++)
	{
		fin >> x >> y;
		v[x].push_back(y);
		gi[y]++;
	}
	topsort(n);
	for (i = 1; i<=n; i++)
		fout << vsort[i] << ' ';
	return 0;
}