#include <iostream>
#include <cstdio>
#include <string>
#include <vector>

using namespace std;

#define NM 10000

int N, M, DEG[NM];
int coada[NM];

vector <int> G[NM];

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].push_back(b);
		++DEG[b];
	}	
	
	int st = 0, dr = -1;
	
	for (int i = 1; i <= N; ++i) if (!DEG[i]) coada[++dr] = i;
	
	while (st <= dr)
	{
		int nod = coada[st];
		++st;
		
		printf ("%d ", nod);
		
		for (int i = 0; i < G[nod].size(); ++i)
		{
			int nnod = G[nod][i];
			DEG[nnod]--;
			if (!DEG[nnod]) coada[++dr] = nnod;
		}	
	}	
	
	return 0;
}