#include <fstream>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <set>
#include <cstring>
#include <map>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#define oo 2000000
#define MOD 1000000007
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<int>v[50005];
int grad[100005];
queue<int>q;
int n, m, x, y;

void sorttop()
{
	for (int i = 1; i <= n; i++)
	{
		if (grad[i] == 0)
		{
			q.push(i);
			
		}
	}
	while (!q.empty())
	{
		int nod = q.front();
		fout << nod << " ";
		q.pop();
		for (auto it : v[nod])
		{
			grad[it]--;
			if (grad[it] == 0)
				q.push(it);
		}
	}
}

int main()
{
	fin >> n >> m;
	while (m--)
	{
		fin >> x >> y;
		grad[y]++;
		v[x].push_back(y);
	}
	sorttop();
}