#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

typedef long long ll;

const ll mod=1e9+7;

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int nmax=50005;
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define rc(x)  return cout<<x<<"\n",0
#define sz(s)  (int) s.size()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second

using namespace std;

ll t,counter=0;
vector<int>v[nmax];
ll viz[nmax];
ll topo[nmax];
void dfs(int a) {
	viz[a]=1;	
	for (auto it:v[a]) {
		if (!viz[it]) {
			dfs(it);
		}
	}
		topo[counter++]=a;
}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	ifstream cin("sortaret.in");
	ofstream cout("sortaret.out");
	int n,m;
	cin >> n >> m;
	for (int i=1; i<=m; i++) {
		ll x,y;
		cin >> x >> y;
		v[x].pb(y);
	}
	for (int i=1; i<=n; i++) {
		if (!viz[i]){
			dfs(i);
		}
	}
	for (int i=n-1; i>=0; i--)cout << topo[i] << " ";
}
/*
10 12
1 6
2 6
2 4
2 6
10 4
2 8
10 1
10 3
2 10
8 5
6 4
2 8*/