#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
#define int long long
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define rc(s) return cout<<s,0
#define cin fin
#define cout fout
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n,m,x,y,g[50001];
vector<int>nod[50001];

int32_t main(){
    ios_base::sync_with_stdio(0);cin.tie();cout.tie();
    cin >> n >> m;
    for(int i=1;i<=m;i++){
        cin >> x >> y;
        nod[x].push_back(y);
        g[y]++;
    }
    queue<int>tab;
    for(int i=1;i<=n;i++){
        if(g[i]==0) tab.push(i);
    }
    vector<int>ans;
    while(tab.empty()==false){
        int x= tab.front();
        for(int i=0;i<nod[x].size();i++){
            g[nod[x][i]]--;
            if(g[nod[x][i]]==0) tab.push(nod[x][i]);
        }
        ans.pb(x);
        tab.pop();
    }
    for(int i=0;i<ans.size();i++) cout<<ans[i]<<' ';
}