#include <vector>
#include <iostream>
#include <cstdio>
#include <set>

using namespace std;

#define NM 50005
#define pb push_back

int N, M;
vector <int> G[NM];
int in[NM];
set <int> indeg0;

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

	scanf ("%d %d", &N, &M);
	
	for (int i = 1; i <= M; ++i)
	{
		int a, b;
		scanf ("%d %d", &a, &b);
		G[a].pb(b);
		++in[b];
	}
	
	for (int i = 1; i <= N; ++i) if (!in[i]) indeg0.insert(i);

	while (!indeg0.empty())
	{
		int cnod = *(indeg0.begin());
		indeg0.erase(cnod);
		printf ("%d ", cnod);
		for (int j = 0; j < G[cnod].size(); ++j)
		{
			int nnod = G[cnod][j];
			--in[nnod];
			if (!in[nnod]) indeg0.insert(nnod);			
		}	
	}

	return 0;
}