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

using namespace std;

#define lg 50005
#define pb push_back

int n, m, i, x, y, fst[lg], q[lg], nr[lg], nrm;
vector<int> v[lg];
void df(int nod){
	
	fst[nod] = 1;
	for (int i = 0; i < nr[nod]; i ++)
		if (!fst[v[nod][i]])
			df(v[nod][i]);
	
	q[++nrm] = nod;
}
int main()
{
	freopen("sortaret.in", "rt", stdin);
	freopen("sortaret.out", "wt", stdout);
	
	scanf("%d%d", &n, &m);
	
	for (i = 1; i <= m; i ++){
		scanf("%d%d", &x, &y);
		
		nr[x] ++;
		v[x].pb(y);
	}
	
	for (i = 1; i <= n; i ++)
		if (!fst[i])
			df(i);
	
	for (i = n; i; i --)
		printf("%d ", q[i]);
	printf("\n");
	
	return 0;
}