#include <cstdio>
#include <vector>
using namespace std;

#define maxsize 50005

int n, m, x, y;
vector<int> gr[maxsize];
int c[maxsize], deg[maxsize];

void sort()
{
	int u;
	vector<int>::iterator it;

	for(int i = 1; i <= n; ++i)
		if(deg[i] == 0)
			c[++c[0]] = i;

	for(int i = 1; i <= n; ++i)
	{
		u = c[i];

		for(it = gr[u].begin(); it != gr[u].end(); ++it)
		{
			--deg[*it];
			if(deg[*it] == 0)
				c[++c[0]] = *it;
		}
	}
}

int main()
{

	freopen("sortaret.in", "r", stdin);
	freopen("sortaret.out", "w", stdout);

	scanf("%d %d", &n, &m);

	for(int i = 0; i < m; ++i)
	{
		scanf("%d %d", &x, &y);

		gr[x].push_back(y);
		++deg[y];
	}
	
	sort();

	for(int i = 1; i <= n; ++i)
		printf("%d ", c[i]);

	return 0;
}