//https://www.pbinfo.ro/probleme/431/graf-complet
//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("fast-math")
//#pragma GCC optimize ("unroll-loops")
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

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

vector <vector <int>> gr;
vector <int> rez;
bool fr[50010];
void dfs(int vf)
{
	fr[vf] = true;
	for (int x : gr[vf])
	{
		if (!fr[x])
		{
			dfs(x);
		}
	}
	rez.push_back(vf);
}
int main()
{
	/*ios_base::sync_with_stdio(false);
	cin.tie(NULL);*/
	int n, m, a, b, i;
	fin >> n >> m;
	gr.resize(n + 1);

	for (i = 1; i <= m; ++i)
	{
		fin >> a >> b;
		gr[a].push_back(b);
	}

	for(i = 1; i <= n; ++i)
	{
		if (fr[i] == 0)
		{
			dfs(i);
		}
	}

	for (int x : rez)
	{
		fout << x << " ";
	}

	return 0;
}