#include <bits/stdc++.h>

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

const int NMAX = 50005;
int n,m;
vector <int> v[NMAX];
vector <int> vec;
bool viz[NMAX];

void dfs(int nod){
    int i,sz = v[nod].size();
    for(i = 0 ; i < sz ; i++)
        if(!viz[v[nod][i]]){
            viz[v[nod][i]] = 1;
            dfs(v[nod][i]);
        }
    vec.push_back(nod);
}

int main(){
    int i,x,y;
    f >> n >> m;
    for(i = 1 ; i <= m ; i++){
        f >> x >> y;
        v[x].push_back(y);
    }
    for(i = 1 ; i <= n ; i++)
        if(!viz[i]){
            viz[i] = 1;
            dfs(i);
        }

    for(i = vec.size() - 1 ; i >= 0 ; i--)
        g << vec[i] << " " ;

    return 0;
}