#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define dbg(x) cout << #x <<": " << x << "\n";
#define sz(x) ((int)x.size())

using ll = long long;

const string fn = "sortaret";
ifstream fin(fn + ".in");
ofstream fout(fn + ".out");

int n, m;
vector<int> g[50005];
bool viz[50005];
vector<int> ord;
void dfs(int nod){
    viz[nod] = 1;
    for(auto i : g[nod])
        if(!viz[i]){dfs(i);}
    ord.pb(nod);
}

int main(){

    fin >> n >> m;
    while(m--){
        int x, y;
        fin >> x >> y;
        g[x].pb(y);
    }
    for(int i = 1; i <= n; ++i)
    if(!viz[i])
    {
        dfs(i);
    }
    reverse(ord.begin(), ord.end());
    for(auto i : ord)
        fout << i << ' ';
    return 0;
}