#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
vector <long> A[50001];
queue <long> coada;
long G[50001], x, y, N, M, i, j, elc;
bool viz[50001];

int main() {
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	
		scanf("%ld %ld", &N, &M);
		
		for (i = 1; i <= M; ++i) {
			scanf("%ld %ld", &x, &y);
			A[x].push_back(y);
		}
		
		for (i = 1; i <= N; ++i) {
			G[i] = A[i].size();
		}
		
		for (i = 1; i <= N; ++i) {
			if ( !viz[i] ) {
				coada.push(i);
				for (; !coada.empty(); coada.pop() ) {
					elc = coada.front();
					viz[elc] = true;
					printf("%ld ", elc);
					for (j = 0; j < G[elc]; ++j) {
						if ( !viz[ A[elc][j] ] ) {
							coada.push(A[elc][j]);
						}
					}
				}
				
			}
		}
		
	
	return 0;
}