#include <stdio.h>
#include <cstring>
#include <vector>

using namespace std;

#define MAXN 50100
#define pb push_back

int N, M, deg[MAXN], Q[MAXN];
vector<int> G[MAXN];

FILE * iff, * off;

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

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

	}
}

void read_data(void) {
	int i, a, b;

	fscanf(iff, "%d %d\n",&N, &M);
	for (i = 1; i <= M; ++i) {
		fscanf(iff,"%d %d\n", &a, &b);
		G[a].pb(b);
		deg[b]++;
	}
}

void write_data(void) {
	int i;
	for (i = 1; i <= N; ++i) {
		fprintf(off,"%d ", Q[i]);
	}
}

int main(void) {
	iff = fopen("sortaret.in","r");
	off = fopen("sortaret.out","w");

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

	return 0;
}