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

#define MAX 50100

int n, m, deg[MAX], queue[MAX];
vector<int> G[MAX];

void solve()
{
	int i, x; 
	vector<int>::iterator it;
	
	for(x = 1; x <= n; ++x)
	   if(deg[x] == 0) queue[++queue[0]] = x;

	for(i = 1; i <= n; ++i)
	{
	   x = queue[i];
	   for(it = G[x].begin(); it != G[x].end(); ++it)
	   {
		deg[*it]--;
		if(deg[*it] == 0) queue[++queue[0]] = *it;
	   }
	}
}

void read_data()
{
	int i, a, b;
	
	scanf("%d %d\n", &n, &m);
	for(i = 1; i <= m; ++i)
	   scanf("%d %d\n", &a, &b), G[a].push_back(b), ++deg[b];
}

void write_data()
{
	int i;

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

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

	read_data();
	solve();
	write_data();

	return 0;
}