#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define ll long long int

int main(){
    ifstream in("sortaret.in");
    ofstream out("sortaret.out");
    int n,m;
    in>>n>>m;
    vector<vector<int>> g(n);
    vector<int> inc(n,0);
    int u,v;
    for(int i=0;i<m;i++){
        in>>u>>v;
        u--,v--;
        g[u].push_back(v);
    }
    bool okay=true;
    vector<int> tps;
    function<void(int)> dfs=[&](int node){
        for(auto v:g[node]){
            if(!inc[v])
                dfs(v);
        }
        tps.push_back(node+1);
        inc[node]=1;
    };
    for(int i=0;i<n;i++){
        if(!inc[i]){
            dfs(i);
        }
    }
    reverse(tps.begin(),tps.end());
    assert(tps.size()==n);
    for(auto x:tps)out<<x<<" ";
    out<<"\n";
    return 0;
}