#include <iostream>
#include <fstream>
#include <vector>


using namespace std;

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

int n, m;
int deg[50001];
int q[50001];

vector<int> v[50001];

void topologicalSort()
{
	int i, x;
	vector<int> ::iterator it;
	for (int x = 1; x <= n; x++)
		if (deg[x] == 0)
			q[++q[0]] = x;
	for (int i = 1; i <= n; i++)
	{
		x = q[i];
		for (it = v[x].begin(); it != v[x].end(); it++)
		{
			deg[*it]--;
			if (deg[*it] == 0)
				q[++q[0]] = *it;
		}
	}
}

/*void topologicalSort()
{
	int i, j, k;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			if (viz[j] == 0 && deg[j] == 0)
			{
				viz[j] = 1;
				fout << j << ' ';
				for (int k = 0; k < v[j].size(); k++)
				{
					deg[v[j][k]]--;
				}
			}
		}
	}
}
*/
void read()
{
	fin >> n >> m;
	int x, y;
	for (int i = 1; i <= m; i++)
	{
		fin >> x >> y;
		v[x].push_back(y);
		deg[y]++;
	}
}

void write()
{
	for (int i = 1; i <= n; i++)
		fout << q[i] << ' ';
}

int main()
{
	read();
	topologicalSort();
	write();
	return 0;
}