#include <fstream>
#include <vector>
#define NMAX 50002
#define INF 0x3f3f3f3f
using namespace std;

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

int n, m, sol[NMAX], grad[NMAX];
vector <int> v[NMAX];

void ReadData ()
{
	fin >> n >> m;
	for (int i = 1, a, b; i <= m; ++i)
	{
		fin >> a >> b;
		v[a].push_back (b);
		grad[b]++;
	}
}

void Sortare_Top ()
{
	for (int i = 1; i <= n; ++i)
	{
		if (grad[i] == 0)
			sol[++sol[0]] = i;
	}
	for (int k = 1; k <= n; ++k)
	{
		int x = sol[k];
		for (int i = 0; i < v[x].size (); ++i)
		{
			grad[v[x][i]]--;
			if (grad[v[x][i]] == 0)
			{
				sol[++sol[0]] = v[x][i];
			}
		}
	}
}

void WriteData ()
{
	for (int i = 1; i <= sol[0]; ++i)
		fout << sol[i] << " ";
}

int main ()
{
	ReadData ();
	Sortare_Top ();
	WriteData ();
}